Topic

Four-color theorem

The result in graph theory stating that the regions of any planar map can be colored with four colors so that no two neighboring regions share a color. Posed in 1852 and first proved with computer assistance more than a century later.

Current clusters

science1 publisher

New four-color theorem proof buys planar-graph insight with more computation

Six researchers spent nearly a decade building a third computer proof of the four-color theorem, one that runs longer than the proofs that came before it. Their return was a much faster coloring method plus new structure in planar graphs.

Publishers:quantamagazine.org

Reality

Evidence58
Adoption20
Hype gap+15
Incentives40
Confidence55