chromatic number of the plane
GPTKB entity
Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Hadwiger–Nelson_problem
|
| gptkbp:describes |
minimum number of colors needed to color the plane so that no two points at distance 1 have the same color
|
| gptkbp:field |
combinatorics
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
chromatic number of the plane
|
| gptkbp:lowerBound |
5
|
| gptkbp:notableAchievement |
Aubrey de Grey proved lower bound is at least 5 in 2018
|
| gptkbp:openProblem |
true
|
| gptkbp:proposedBy |
gptkb:Edward_Nelson
|
| gptkbp:relatedTo |
gptkb:Hadwiger–Nelson_problem
unit distance graph |
| gptkbp:upperBound |
7
|
| gptkbp:yearProposed |
1950
|
| gptkbp:bfsParent |
gptkb:The_Mathematical_Coloring_Book
|
| gptkbp:bfsLayer |
6
|