October 21, 2026
Finding Every Smallest C6-Saturated Graph
An eleven-vertex witness, 205 minimum graphs on fourteen vertices, and the difference between finding an example and proving a minimum.
Browse posts by tag
An eleven-vertex witness, 205 minimum graphs on fourteen vertices, and the difference between finding an example and proving a minimum.
Recent work on graph saturation, formal mathematics, and conversational memory, with a few experiments that changed what I thought I was measuring.
I pointed Claude Code at the Erdős problem database with vague instructions to 'find interesting things.' It built 92 Python modules, ran 131 subagents, and computed exact Ramsey numbers nobody had computed before. I mostly watched.