Map Coloring, Polyhedra, and the Four-Color Problem (Dolciani Mathematical Expositions Vol 8)
June 28, 2018
In the summer of 1976 Kenneth Appel and Wolfgang Haken of the University of Illinois announced that they had solved the Four-Color Problem. Suddenly what had been known to several generations of mathematicians as the Four-Color Conjecture had become the FourColor Theorem. Since it had been a conjecture for over one hundred years that all maps are four-colorable, and since a great deal of mathematics was done in attempts to solve the Four-Color Conjecture, it will be called a conjecture rather than a theorem throughout most of this book. Although the Four-Color Theorem has now been proved, the mathematics developed during the numerous unsuccessful attempts is nevertheless of lasting value. Much of combinatorial mathematics had its beginings in work on the Four-Color Conjecture. The applications of this mathematics goes far beyond coloring problems.
Download ToanKho: http://lk.libvui.com/cM9P