four colour map theorem

Computing Dictionary

four colour map theorem definition

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)

The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source
Explore Dictionary.com
Previous Definition: four color theorem
Next Definition: four colour theorem
More from Thesaurus.com
Synonyms and Antonyms for four colour map theorem
More from Reference.com
Search for articles containing four colour map theorem
Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014 Dictionary.com, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature