On the Chromatic Number of the Plane with Two Forbidden Distances

DOI10.1080/00029890.2025.2559554MaRDI QIDQ6838207zbMATH OpenFDO

Authors Jan De Neve, Ferre Vanden Kerchove, D. Colle, Mario Pickavet

Publication date 25 March 2026

Published in American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00029890.2025.2559554

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A small 6-chromatic two-distance graph in the plane
• Computing small unit-distance graphs with chromatic number 5
• Every planar map is four colorable. I: Discharging
• Four colors suffice. How the map problem was solved. With a foreword by Ian Stewart
• Graph minimization, focusing on the example of 5-chromatic unit-distance graphs in the plane
• Graph Theory and Probability
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• The chromatic number of the plane is at least 5
• The chromatic number of the plane is at least 5 -- a human-veriviable proof
• The New Mathematical Coloring Book

This page was built for publication: On the Chromatic Number of the Plane with Two Forbidden Distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6838207)