|
gptkbp:instanceOf
|
gptkb:mathematical_concept
|
|
gptkbp:appliesTo
|
planar graphs
maps on a plane
|
|
gptkbp:category
|
gptkb:combinatorics
gptkb:logic
discrete mathematics
|
|
gptkbp:doesNotRegulate
|
non-planar graphs
|
|
gptkbp:field
|
gptkb:topology
graph theory
|
|
gptkbp:first_conjectured_by
|
gptkb:Francis_Guthrie
|
|
gptkbp:first_proved_by
|
gptkb:Wolfgang_Haken
gptkb:Kenneth_Appel
|
|
gptkbp:has_counterexamples_for
|
higher genus surfaces
|
|
gptkbp:influenced
|
development of computer-assisted proofs
|
|
gptkbp:notable_for
|
first major theorem proved using a computer
|
|
gptkbp:proof_method
|
computer-assisted proof
|
|
gptkbp:publishedIn
|
gptkb:Illinois_Journal_of_Mathematics
|
|
gptkbp:related_mathematician
|
gptkb:Peter_Guthrie_Tait
gptkb:Martin_Gardner
gptkb:Alfred_Kempe
gptkb:Heinrich_Heesch
gptkb:Gerhard_Ringel
gptkb:Percy_John_Heawood
|
|
gptkbp:related_open_problem
|
gptkb:Hadwiger's_conjecture
|
|
gptkbp:related_theorem
|
gptkb:Five_Color_Theorem
|
|
gptkbp:relatedConcept
|
gptkb:planar_graph
graph coloring
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:subject
|
mathematical history
mathematical computer science
mathematical controversy
|
|
gptkbp:year_conjectured
|
1852
|
|
gptkbp:year_proved
|
1976
|
|
gptkbp:bfsParent
|
gptkb:Graph_Theory
gptkb:Tait_graph
gptkb:Chromatic_Number
gptkb:Formalization_of_the_Four_Color_Theorem
|
|
gptkbp:bfsLayer
|
7
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Four Color Theorem
|