Map Color Theorem

ISBN-13: 9783642657610 / Angielski / Miękka / 2011 / 194 str.

G. Ringel

Opis

In 1890 P. J. Heawood 35] published a formula which he called the Map Colour Theorem. But he forgot to prove it. Therefore the world of mathematicians called it the Heawood Conjecture. In 1968 the formula was proven and therefore again called the Map Color Theorem. (This book is written in California, thus in American English. ) Beautiful combinatorial methods were developed in order to prove the formula. The proof is divided into twelve cases. In 1966 there were three of them still unsolved. In the academic year 1967/68 J. W. T. Youngs on those three cases at Santa Cruz. Sur invited me to work with him prisingly our joint effort led to the solution of all three cases. It was a year of hard work but great pleasure. Working together was extremely profitable and enjoyable. In spite of the fact that we saw each other every day, Ted wrote a letter to me, which I present here in shortened form: Santa Cruz, March 1, 1968 Dear Gerhard: Last night while I was checking our results on Cases 2, 8 and 11, and thinking of the great pleasure we had in the afternoon with the extra ordinarily elegant new solution for Case 11, it seemed to me appropriate to pause for a few minutes and dictate a historical memorandum. We began working on Case 8 on 10 October 1967, and it was settled on Tuesday night, 14 November 1967."

Spis treści

1. Problems, Illustrations, History.- 1.1.The Four Color Problem.- 1.2. Map Color Theorem.- 1.3. The Thread Problem.- 1.4. Unilateral Surfaces.- 2. Graph Theory.- 2.1. Chromatic Number.- 2.2. Rotations of Graphs.- 2.3. Orientable Cases 7 and 10.- 3. Classification of Surfaces.- 3.1. The Concept of Topology.- 3.2. Polyhedra.- 3.3. Elementary Operations.- 3.4. Normal Form for Orientable Surfaces.- 3.5. Normal Form for Non-Orientable Surfaces.- 3.6. Standard Models.- 3.7. Partial Polyhedra.- 4. Graphs on Surfaces.- 4.1. Embedding Theorem.- 4.2. Dual Polyhedra.- 4.3. Heawood’s Inequality.- 4.4. Genus of Graphs.- 4.5. Non-Orientable Genus of Graphs.- 4.6. Klein’s Bottle.- 5. Combinatorics of Embeddings.- 5.1. Triangular Embeddings.- 5.2. Orientable Special Cases.- 5.3. Outline for General Cases.- 6. Orientable Cases 1, 4, and 9.- 6.1. Orientable Case 4.- 6.2. Arithmetic Combs.- 6.3. Orientable Case 1.- 6.4. Coil Diagrams.- 6.5. Orientable Case 9.- 7. Orientable Cases 11, 2, and 8.- 7.1. Example for n=35.- 7.2. Orientable Case 11.- 7.3. The Additional Adjacency Problem.- 7.4. Orientable Case 2.- 7.5. Additional Adjacency Problem.- 7.6. Orientable Case 8.- 8. Non-Orientable Cases (Index 1).- 8.1. Method of Doubling.- 8.2. Non-Orientable Cases 0, 3, 7.- 8.3. Cascades.- 8.4. Orientable Application.- 9. Solutions of Index 2 and 3.- 9.1. Examples and Method.- 9.2. Orientable Cases 3 and 5.- 9.3. Orientable Case 6.- 9.4. Non-Orientable Case 9.- 10. Construction by Induction.- 10.1. An Index 3 Induction.- 10.2. An Index 2 Induction.- 10.3. Non-Orientable Cases 1, 2, 6, and 10.- 11. Orientable Case 0.- 11.1. Currents from Non-Abelian Groups.- 11.2. Examples.- 11.3. General Solution.- 12. Related Problems.- 12.1. Questions about Rotations.- 12.2. Questions about Embeddings.- References.