Family 158CombinatoricsLeanNot yet digestedfeatured
The Euclidean plane cannot be colored with five colors
Proves that every five-coloring of the Euclidean plane has a monochromatic pair at distance one, with no restriction on the color classes. This advances the Hadwiger–Nelson problem: together with the classical seven-coloring, only six and seven remain possible chromatic numbers of the plane.
Manuscripts in this family · 1
The Euclidean plane is not five-colorable
Sep 23, 2026·paper.pdfLean
We prove that every coloring of the Euclidean plane with five colors has a monochromatic unit-distance pair, with no regularity assumption on the color classes. Consequently, the chromatic number of the plane is either six or seven.