Submitted:
03 October 2026
Posted:
08 October 2026
You are already at the latest version
Abstract
Voronov, Neopryatnaya and Dergachev constructed 5-chromatic unit-distance graphs on the sphere \( S^2(r_1), r_1=\cos\frac{\pi}{10} \), with \( 372 \) vertices, and on \( S^2(r_2) \), \( r_2=\cos\frac{3\pi}{10} \), with \( 972 \) vertices, and noted that the first graph stays 5-chromatic after deleting any single vertex. By SAT-based vertex minimization we find a 5-chromatic subgraph of the first graph with \( 231 \) vertices and \( 938 \) edges, and one of the second with \( 961 \) vertices and \( 4028 \) edges. Both are vertex-critical and contain no Moser spindle; the smaller one is the best found by our search, not a proved minimum. All coordinates are given exactly in nested radicals and verified in exact arithmetic; non-4-colourability is certified by DRAT proofs checked with DRAT-TRIM.
Keywords:
Hadwiger–Nelson problem
; unit-distance graph
; chromatic number
; sphere
; vertex-critical graph
; SAT solver
; DRAT proof
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.