Hootsgo
Published on Hootsgo (https://hootsgo.org)


The Four Color Theorem

How many colors do you need to shade a map?

The small island nation of Seedonia is organized into three provinces: Sciville, Connexia, and Collabdale.

4-color theorem

One year, Connexia’s two best soccer teams played to a 1-1 tie in the Provincial Championship. Being unable to decide which team to send to the National Tournament, the people of Connexia voted to split the province into North Connexia and South Connexia so they could send both teams, one from each of the new provinces.

4-color theorem

Some years later, for reasons that are not clear, Collabdale split into Upper Collabdale and Lower Collabdale. Map publishers in Seedonia became concerned about the rising cost of printing maps, since they had already gone from three to four colors when Connexia split. How could they avoid using the same color for adjacent provinces without adding a fifth color?

One mapmaker solved the problem like this:

4-color theorem

Moreover, he claimed that he could also color the ocean, which in earlier maps had been left blank, without adding a color. He even claimed that no matter what course Seedonia’s political future took, he could color any map, regardless of how many provinces there were and no matter how they drew their borders, using only four colors. No two adjacent provinces would have to be in the same color.

Is he correct? Can you come up with a map—real or imaginary—that requires more than four colors? The key requirement is that no region can share an edge with another region of the same color. Corner touching is OK. For example, this map uses only two colors and doesn’t violate the rules:

4-color theorem

Try it with a friend. One of you can draw a difficult map for the other to try to color.

If you can’t find a map that requires more than four colors, can you prove that no more than four are ever needed?

Make up some puzzles like these and send them in with your solutions. We’ll post them here in the SEED Science Center.


This content has been re-published with permission from SEED. Copyright © 2025 Schlumberger Excellence in Education Development (SEED), Inc.

Course: 

  • Math [1]
Result/Solution(s)

Solution: The Four-Color Theorem Math Puzzle

The four-color problem dates back at least to 1852, when Francis Guthrie found that he could color a map of England’s counties using only four colors. He wondered if four colors were enough for any map. Although no one has ever found a map that requires more than four colors, a formal proof that this was true eluded mathematicians until 1976, when Kenneth Appel and Wolfgang Haken of the University of Illinois claimed to have found a proof. The proof was so complex as to require a computer to do much of the work, and the proof could not be checked without using a computer. This led some mathematicians to question its validity.

Related Links

These links go outside the SEED Web site. When you click on one, it will open in a new browser window. Close that window when you are done (don't use the "back" button) and you will be looking at this page again.

To find out more about the four-color theorem and its proof, check these Web sites:

The Four Color Theorem [2] 
The Four Colour Theorem [3] 
The Four-Color Theorem—from Wolfram MathWorld [4]

  • math [5]
  • Math Puzzle [6]
Copyright © 2018 Hootsgo. All Rights Reserved. Hootsgo is a registered 501 (c) (3) non-profit organization.
Donated by Dev2Source I.T. Services Ltd.

Source URL: https://hootsgo.org/?q=four-color-theorem&qt-quicktabs=1

Links
[1] https://hootsgo.org/?q=taxonomy/term/50
[2] http://people.math.gatech.edu/~thomas/FC/fourcolor.html
[3] http://www-gap.dcs.st-and.ac.uk/~history/HistTopics/The_four_colour_theorem.html
[4] http://mathworld.wolfram.com/Four-ColorTheorem.html
[5] https://hootsgo.org/?q=tags/math
[6] https://hootsgo.org/?q=tags/math-puzzle