You are here: irt.org | FOLDOC | four colour map theorem
<mathematics, application> (Or "four colour theorem") The theorem stating that if the plane is divided into connected regions which are to be coloured so that no two adjacent regions have the same colour (as when colouring countries on a map of the world), it is never necessary to use more than four colours.
The proof, due to Appel and Haken, attained notoriety by using a computer to check tens of thousands of cases and is thus not humanly checkable, even in principle. Some thought that this brought the philosophical status of the proof into doubt.
There are now rumours of a simpler proof, not requiring the use of a computer.
See also chromatic number
(1995-03-25)
Nearby terms: foundation « FOundation for Research and Technology - Hellas « four-colour glossies « four colour map theorem » four colour theorem » Fourier transform » fourth generation computer
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL