Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:category |
unsolved problems in mathematics
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hadwiger's conjecture
|
| gptkbp:implies |
gptkb:Four_color_theorem
|
| gptkbp:namedAfter |
gptkb:Hugo_Hadwiger
|
| gptkbp:proposedBy |
gptkb:Hugo_Hadwiger
|
| gptkbp:relatedTo |
graph
chromatic number graph minor |
| gptkbp:satisfies |
t ≤ 6
|
| gptkbp:sentence |
If a graph is not (t-1)-colorable, then it contains K_t as a minor.
|
| gptkbp:status |
open problem
|
| gptkbp:yearProposed |
1943
|
| gptkbp:bfsParent |
gptkb:Discrete_geometry
|
| gptkbp:bfsLayer |
5
|