|
gptkbp:instanceOf
|
gptkb:mathematical_concept
|
|
gptkbp:application
|
cartography
network design
frequency assignment
|
|
gptkbp:category
|
solved problems in mathematics
unsolved problems in mathematics (historically)
|
|
gptkbp:describes
|
the coloring of maps
|
|
gptkbp:field
|
gptkb:combinatorics
gptkb:topology
graph theory
|
|
gptkbp:first_formulated_by
|
gptkb:Francis_Guthrie
|
|
gptkbp:firstPublished
|
gptkb:Arthur_Cayley
1879
|
|
gptkbp:influenced
|
development of computer-assisted proofs
|
|
gptkbp:Kempe's_proof
|
disproved by Percy Heawood in 1890
|
|
gptkbp:method
|
computer-assisted proof
|
|
gptkbp:notable_for
|
being the first major theorem proved using a computer
|
|
gptkbp:notablePublication
|
Appel and Haken's 1977 paper in Illinois Journal of Mathematics
|
|
gptkbp:related_conjecture
|
gptkb:Hadwiger's_conjecture
|
|
gptkbp:relatedConcept
|
gptkb:planar_graph
chromatic number
map coloring
|
|
gptkbp:relatedTo
|
gptkb:five_color_theorem
graph coloring
Kempe's attempted proof
|
|
gptkbp:solvedBy
|
gptkb:Wolfgang_Haken
gptkb:Kenneth_Appel
|
|
gptkbp:state
|
any planar map can be colored with at most four colors so that no adjacent regions share a color
|
|
gptkbp:year_formulated
|
1852
|
|
gptkbp:year_solved
|
1976
|
|
gptkbp:bfsParent
|
gptkb:Barrington_Bayley
|
|
gptkbp:bfsLayer
|
8
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
The Four-Color Problem
|