## Abstract A major event in 1976 was the announcement that the Four Color Conjecture (4CC) had at long last become the Four Color Theorem (4CT). The proof by W. Haken, K. Appel, and J. Koch is published in the __Illinois Journal of Mathematics__, and their twoโpart article outlines the nature and
The four color theorem has been proved
- Publisher
- John Wiley and Sons
- Year
- 1977
- Tongue
- English
- Weight
- 26 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
โฆ Synopsis
On the 21st of June 1976, which was the 48th birthday of Wolfgang Haken, he and Kenneth Appel (with the aid of John Koch) completed their proof of the Four Color Theorem. In recognition of their momentous achievement, the Journal ofGruph Theory presents two articles (by Haken and by Frank Bernhart) on this famous problem, preceded by a short poem by the mysterious Blanche Descartes.
The foremost currently unsolved problem in graph theory is, in our considered opinion, the Reconstruction Conjecture.
๐ SIMILAR VOLUMES
We introduce a signed version of the diagonal flip operation. We then formulate the conjecture that any two triangulations of a given polygon may be transformed into one another by a signable sequence of diagonal flips. Finally, we show that this conjecture, if true, would imply the four color theor
A set X; with a coloring D: X ! Z m ; is zero-sum if P x2X Dรฐxร ยผ 0: Let f รฐm; rร (let f zs รฐm; 2rร) be the least N such that for every coloring of 1; . . . ; N with r colors (with elements from r disjoint copies of Z m ) there exist monochromatic (zero-sum) m-element subsets B 1 and B 2 ; not neces