Hadwiger–Nelson problem
For a set , call a map a proper coloring of the plane if
where denotes the Euclidean norm. Equivalently, let be the unit-distance graph of the plane: the graph whose vertex set is , with an edge if and only if ; a proper coloring of the plane is exactly a proper vertex coloring of .
Determine the chromatic number of the plane,
that is, the least number of colors with which the points of the plane can be colored so that no two points at distance exactly receive the same color.
References
- Wikipedia, Hadwiger–Nelson problem, the article this problem comes from.
Source: Wikipedia
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 1
Claimed by OpenAI.See full solution
Claims every five-coloring of the Euclidean plane has a monochromatic unit-distance pair without regularity assumptions, so the chromatic number is six or seven; this is a lower-bound improvement, not determination of its exact value.
Repository: https://github.com/openai/math
- OpenAI-158-01-The-Euclidean-plane-is-not-five-colorable.pdfOpen