Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
gptkb:chromatic_number_of_the_plane
|
| gptkbp:field |
gptkb:geometry
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Hadwiger–Nelson problem
|
| gptkbp:lowerBound |
5
|
| gptkbp:notableProgress |
A 2018 result by Aubrey de Grey showed the lower bound is at least 5.
|
| gptkbp:proposedBy |
gptkb:Edward_Nelson
|
| gptkbp:relatedTo |
gptkb:Moser_spindle
chromatic number unit distance graph |
| gptkbp:type |
What is the minimum number of colors needed to color the plane so that no two points at distance exactly one from each other have the same color?
|
| gptkbp:upperBound |
7
|
| gptkbp:yearProposed |
1950
|
| gptkbp:bfsParent |
gptkb:combinatorial_geometry
gptkb:The_Mathematical_Coloring_Book gptkb:Hugo_Hadwiger |
| gptkbp:bfsLayer |
6
|