The chromatic number of the plane is at least 5: a new proof

DOI10.1007/s00454-019-00058-1zbMath1445.05040arXiv1805.00157OpenAlexW2963183679WikidataQ128545239 ScholiaQ128545239MaRDI QIDQ2189746

Geoffrey Exoo, Dan P. Ismailescu

Publication date: 16 June 2020

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringchromatic number of the plane

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\) ⋮ Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres ⋮ Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions ⋮ Decidability of modal logics of non-\(k\)-colorable graphs ⋮ Max-norm Ramsey theory ⋮ Triangle colorings require at least seven colors ⋮ Avoiding Multiple Repetitions in Euclidean Spaces ⋮ All finite sets are Ramsey in the maximum norm

Cites Work

• The fractional chromatic number of the plane
• The Mathematical Coloring Book
• The chromatic number of the plane is at least 5
• Computing Small Unit-Distance Graphs with Chromatic Number 5
• Unnamed Item
• Unnamed Item

This page was built for publication: The chromatic number of the plane is at least 5: a new proof