A 6-chromatic two-distance graph in the plane

MaRDI QIDQ5132833zbMATH OpenFDO

Authors Geoffrey Exoo, Dan Ismailescu

Publication date 12 November 2020

Full work available at URL https://arxiv.org/abs/1909.13177

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Abstract: We prove that if one colors each point of the Euclidean plane with one of five colors, then there exist two points of the same color that are either distance $1$ or distance $2$ apart.

Recommendations

• A small 6-chromatic two-distance graph in the plane
• scientific article; zbMATH DE number 841592
• Another six-coloring of the plane
• A 6-chromatic odd-distance graph in the plane
• The chromatic number of the plane is at least 5: a new proof

Cited in

(12)

• All unit-distance graphs of order 6197 are 6-colorable
• Note on a Ramsey-type problem in geometry
• Another six-coloring of the plane
• The odd-distance plane graph
• The chromatic number of the plane is at least 5 -- a human-veriviable proof
• Finite -unit distance graphs
• The Hadwiger-Nelson problem with two forbidden distances
• scientific article; zbMATH DE number 866016 (Why is no real title available?)
• A 6-chromatic odd-distance graph in the plane
• A small 6-chromatic two-distance graph in the plane
• scientific article; zbMATH DE number 7274124 (Why is no real title available?)
• Coloring distance graphs on the plane

This page was built for publication: A 6-chromatic two-distance graph in the plane

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