Browse posts by tag
Four extremal graphs deposited to the House of Graphs: a minimum C6-saturated graph and three Zarankiewicz witnesses. Plus two new exact saturation values, verified and prepared for deposit.
Fifteen integer sequences now published in the OEIS: nine authored, six extended. Computed by SAT solving and exhaustive search, checked against prior art, spread across seven fields.
Extremal-graph witnesses I deposited to the House of Graphs: minimum saturated graphs for C6, K_4, and P_4, and extremal Zarankiewicz bipartite graphs z(m,n;3,4). Each computed by SAT solving or exhaustive enumeration, re-verified from its graph6 …
Integer sequences I have authored or extended in the On-Line Encyclopedia of Integer Sequences, across Ramsey theory, extremal graph theory, knot theory, algebraic graph theory, additive combinatorics, Boolean function complexity, and combinatorial …
A from-first-principles tour of double-lex symmetry breaking for SAT: why the UNSAT side is expensive, how canonical-representative constraints fix it, a worked Zarankiewicz example that settled three new OEIS values, and an honest map of where the …
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.