<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Matěj Havlíček: Deep dives</title><description>Matěj Havlíček, fullstack engineer. Projects and deep dives into whatever caught my curiosity, with code, math and interactive figures.</description><link>https://personal-website.matej-havlicek6.workers.dev</link><item><title>Four days with the 509: searching for the smallest graph that needs five colours</title><link>https://personal-website.matej-havlicek6.workers.dev/research/five-colours-509</link><guid isPermaLink="true">https://personal-website.matej-havlicek6.workers.dev/research/five-colours-509</guid><description>Claude and I tried to beat the 509-vertex record for the plane’s chromatic number. We didn’t. We found a 509 built on a different foundation, took the record apart, and learned exactly why it is so hard to shrink.</description><pubDate>Wed, 18 Nov 2026 00:00:00 GMT</pubDate><category>mathematics</category><category>graph theory</category><category>SAT solving</category><category>search</category></item></channel></rss>