Difference between revisions
hadwiger-nelson
Status and infobox
- status:
—→ partial - kind:
—→ problem - year:
—→ 1950 - statement:
—→ How many colors are needed to color the plane so that no two points at distance 1 share a color?
Source +18 −0
+---
+title: Hadwiger–Nelson problem
+kind: problem
+status: partial
+year: 1950
+authors: Edward Nelson
+statement: How many colors are needed to color the plane so that no two points at distance 1 share a color?
+space: combinatorics
+---
+The answer is 5, 6 or 7. The lower bound of 5 came in 2018 from Aubrey de Grey, an amateur, who found a unit-distance graph needing five colors. A Polymath project then shrank his graph from 1,581 vertices to about 500. The answer may depend on the axioms of set theory if the coloring is not required to be measurable.
+
+Posed 1950, Edward Nelson.
+
+## Sources
+
+- [Wikipedia: Hadwiger–Nelson problem](https://en.wikipedia.org/wiki/Hadwiger%E2%80%93Nelson_problem)
+
+[[Space:combinatorics|Combinatorics]] · [[Continent:mathematics|Mathematics]]
Revision 37 as rendered
The answer is 5, 6 or 7. The lower bound of 5 came in 2018 from Aubrey de Grey, an amateur, who found a unit-distance graph needing five colors. A Polymath project then shrank his graph from 1,581 vertices to about 500. The answer may depend on the axioms of set theory if the coloring is not required to be measurable.
Posed 1950, Edward Nelson.