See Also: four-colour map problem(encyclopedia)
problem(dictionary)
problem(dictionary)
Problem(medicine)
Underinvestment problem(finance)
Lemons problem(finance)
problem-solving(dictionary)
Agency problem(finance)
Underinvestment problem(money)
Problem Solving(money)

four-colour map problem (sh)




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.