Problemresearch
Hadwiger-Nelson problem
Also called chromatic number of the plane.
Minimum number of colors needed to color the plane so that no two points at unit distance share a color; known to lie between 5 and 7.
Minimum number of colors needed to color the plane so that no two points at unit distance share a color; known to lie between 5 and 7.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag DHZRR9 Edit this page History Report an error