# Four Color Theorem

(Difference between revisions)
 Revision as of 15:12, 3 June 2009 (edit)← Previous diff Revision as of 15:26, 3 June 2009 (edit) (undo)Next diff → Line 5: Line 5: |ImageDescElem=How many colors are needed to color the territories of a map, if all the territories that share a border must be of different colors? |ImageDescElem=How many colors are needed to color the territories of a map, if all the territories that share a border must be of different colors? - This simple question has resulted in much mathematical difficulty, particularly + It turns out that only four colors are needed to color such a two-dimensional map. It has taken over a century for a correct proof of this fact to emerge, and the proof can currently only be carried out with the aid of computers. |AuthorName=Brendan John |AuthorName=Brendan John

## Revision as of 15:26, 3 June 2009

Four Color

Four coloring and graph representation of the United States.

# Basic Description

How many colors are needed to color the territories of a map, if all the territories that share a border must be of different colors?

It turns out that only four colors are needed to color such a two-dimensional map. It has taken over a century for a correct proof of this fact to emerge, and the proof can currently only be carried out with the aid of computers.