The Heawood number of a surface is an upper bound for the maximal number of colors needed to color any graph embedded in the surface. In 1890 Heawood proved for all surfaces except the sphere that no more than
colors are needed to color any graph embedded in a surface of Euler characteristic . The case of the sphere is the four-color conjecture which was settled by Appel and Haken in 1976. The number became known as Heawood number in 1976. Franklin proved that the chromatic number of a graph embedded in the Klein bottle can be as large as , but never exceeds . Later it was proved in the works of Ringel and Youngs that the complete graph of vertices can be embedded in the surface unless is the Klein bottle. This established that Heawood’s bound could not be improved.
For example, the complete graph on vertices can be embedded in the torus as follows:
- 1 Béla Bollobás. Graph Theory: An Introductory Course, volume 63 of GTM. Springer-Verlag, 1979. http://www.emis.de/cgi-bin/zmen/ZMATH/en/quick.html?type=html&an=0411.05032Zbl 0411.05032.
- 2 Thomas L. Saaty and Paul C. Kainen. The Four-Color Problem: Assaults and Conquest. Dover, 1986. http://www.emis.de/cgi-bin/zmen/ZMATH/en/quick.html?type=html&an=0463.05041Zbl 0463.05041.
|Date of creation||2013-03-22 13:21:21|
|Last modified on||2013-03-22 13:21:21|
|Last modified by||bbukh (348)|