Maps of Many Colors
Library Home 
Full Table of Contents 
Library Help
http://www.maa.org/mathland/mathland_1_6.html  


Ivars Peterson (MathLand)  
The 4color map theorem: are four colors always enough to fill in every conceivable map that can be drawn on a flat piece of paper so that no countries sharing a common boundary are the same color? A single shared point doesn't count as a shared border. Otherwise, a map whose countries are arranged like the wedges of a pie would need as many colors as there are countries. Also, countries must be connected regions; they can't have colonies scattered all over the map. The fourcolor problem has intrigued and stumped professional and amateur mathematicians alike ever since it was first proposed in 1852 by a British graduate student, Francis Guthrie, in a letter to his younger brother. In 1976, Kenneth Appel and Wolfgang Haken of the University of Illinois announced that they had finally proved the fourcolor theorem...  


Levels:  High School (912), College 
Languages:  English 
Resource Types:  Problems/Puzzles, Articles 
Math Topics:  Graph Theory 
[Privacy Policy] [Terms of Use]
© 1994 The Math Forum at NCTM. All rights reserved.
http://mathforum.org/