Mathematics#17 in May 2026 EditionThe chromatic number of the Euclidean plane and distance graphs on higher-dimensional spheres
Tobias Keller, Alexei Petrov, Maya Sundaram et al.
OPENSTEM EDITORIAL SUMMARY
What the research examines
Combining spectral graph theory with massive SAT-solver verified unit-distance subgraphs, mathematicians prove that any finite unit-distance graph embedded in the plane can be 5-colored, providing tight lower and upper constraints on the Hadwiger-Nelson problem.
Why it may matter
Brings clarity to one of the most famous open challenges in discrete Euclidean Ramsey theory.
What to examine carefully
Verifying the non-colorability of 5-chromatic candidate graphs requires millions of CPU hours of SAT solver computation.
Editorial scope: This is a concise, independently written introduction based on the publisher information, not a full systematic review or independent replication. It must not replace reading the original methods, limitations and conclusions.
STUDENT RESEARCH LENS · ORIGINAL OPENSTEM NOTES
Try a small, reproducible follow-up
Construct the 7-vertex Moser spindle unit-distance graph in NetworkX and verify that its chromatic number is equal to 4.
Questions to investigate
- How was coordinate precision preserved in automated SAT-solver graph reductions to avoid rounding artifacts?
- Can the spectral clique-expansion method be generalized to unit-distance graphs on the 2-sphere S^2?
These are independently proposed educational investigations, not activities that the original research authors claim to have completed.
Publication & researcher information
JournalCombinatorica
Published online2026-05-08
Authors (selected)Tobias Keller, Alexei Petrov, Maya Sundaram et al.
University / laboratoryUniversity of Oxford
CountryUnited Kingdom
Multi-author research may involve universities in several countries. Unverified institutions and contact addresses are not inferred from authors' names.