A 14-vertex 6-chromatic distance graph in the Euclidean plane (prescribed distances 1, 1/sqrt3, 2) with clique number 4 - plus a proof that this distance system admits no K5 at all. Human-readable proofs, exact data, SAT+CI verification
python networkx graph-theory combinatorics sympy graph-coloring discrete-geometry computer-assisted-proof sat-solving chromatic-number exact-arithmetic clique-number distance-graph euclidean-distance-graph few-distance-graph geometric-graph-theory vertex-critical-graph
-
Updated
Jul 22, 2026 - TeX