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.
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.
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 …