four-colour map problem
four-colour map problem
In topology, a long-standing conjecture asserting that no more than four colours are required to shade in any map such that each adjacent region is coloured differently. First posed in 1852 by Francis Guthrie, a British math student, it was solved by Kenneth Appel and Wolfgang Haken using a computer-assisted proof in 1976.
This entry comes from Encyclopædia Britannica Concise.
For the full entry on four-colour map problem, visit Britannica.com.
Seen & Heard 
What made you look up four-colour map problem? Please tell us what you were reading, watching or discussing that led you here.
