Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
gptkb:topology
graph theory |
| gptkbp:first_conjectured_by |
gptkb:Francis_Guthrie
|
| gptkbp:first_proved_by |
gptkb:Wolfgang_Haken
gptkb:Kenneth_Appel |
| https://www.w3.org/2000/01/rdf-schema#label |
The Four Colour Theorem
|
| gptkbp:proof_method |
computer-assisted proof
|
| gptkbp:publishedIn |
gptkb:Illinois_Journal_of_Mathematics
|
| gptkbp:related_open_problem |
gptkb:Hadwiger's_conjecture
|
| gptkbp:related_theorem |
Five Colour Theorem
|
| gptkbp:relatedConcept |
gptkb:planar_graph
graph coloring chromatic number map coloring |
| gptkbp:relatedTo |
planar graphs
Kempe chains |
| gptkbp:sentence |
Any planar map can be colored with at most four colors so that no two adjacent regions share the same color.
|
| gptkbp:significance |
first major theorem proved using a computer
|
| gptkbp:year_first_conjectured |
1852
|
| gptkbp:year_first_proved |
1976
|
| gptkbp:bfsParent |
gptkb:singingbanana
|
| gptkbp:bfsLayer |
8
|