The Four Color Theorem
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Robertson, Sanders, Seymour, Thomas; Georgia Tech|
|A brief summary of a new proof of the Four Color Theorem, with a four-coloring algorithm found by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas, illustrated using a map of the United States. Contents: History; Why a new proof?; Outline of the proof; Main features; Configurations; Discharging rules; Pointers; A quadratic algorithm; Discussion; References.|
|Levels:||High School (9-12), College, Research|
|Math Topics:||Graph Theory, Euclidean Plane Geometry, History and Biography, Geography|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.