Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:countryOfOrigin |
gptkb:United_Kingdom
|
| gptkbp:field |
gptkb:combinatorics
gptkb:topology graph theory |
| gptkbp:influenced |
graph coloring algorithms
computer-assisted proofs |
| gptkbp:notableFor |
first major theorem proved using a computer
|
| gptkbp:provenBy |
gptkb:Wolfgang_Haken
gptkb:Kenneth_Appel computer-assisted proof |
| gptkbp:publishedIn |
gptkb:Illinois_Journal_of_Mathematics
|
| gptkbp:relatedConcept |
gptkb:planar_graph
gptkb:five_color_theorem chromatic number map coloring |
| gptkbp:sentence |
Any planar map can be colored with at most four colors so that no two adjacent regions share the same color.
|
| gptkbp:statedIn |
gptkb:Francis_Guthrie
|
| gptkbp:yearProposed |
1852
|
| gptkbp:yearProved |
1976
|
| gptkbp:bfsParent |
gptkb:Graph_coloring_problem
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Four color theorem
|