Skip to main content
Log in

The four color proof suffices

  • Article
  • Published:
The Mathematical Intelligencer Aims and scope Submit manuscript

Conclusion

Since no one else has communicated any other errors in the published unavoidability proof since 1976 we assume that a misunderstanding of the nature of Schmidt’s work was the source of those rumors that seem to have stimulated so much new interest in our work. We would certainly appreciate independent verification of the remaining 60 percent of our unavoidability proof and would be grateful for any information on further bookkeeping (or other) errors whenever such are found.* We have written computer programs preparatory to a thorough com puter verification of all of the material in the microfiche supplements. When this is completed we plan to publish (entirely on paper rather than on microfiche cards) an entire emended version of our original proof including theq-positive bookkeeping. At first thought one might think that we would miss the pleasures of discussing the latest rumors with our colleagues returning from meetings but further consideration leads us to believe that facts have never stopped the propagation of a good rumor and so nothing much will change.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. F. Allaire, Another proof of the Four Colour Theorem I, Proc. of the Seventh Manitoba Conference on Numerical Mathematics and Computing, Univ. Manitoba, Winnipeg, Man., 1977, pp. 3–72.

    Google Scholar 

  2. F. Allaire and E. R. Swart, A systematic approach to the determination of reducible configurations in the four-color conjecture, J. Combinatorial Theory(B)25(1978), pp. 339–362.

    Article  MATH  MathSciNet  Google Scholar 

  3. K. Appel and W. Haken, Every planar map is four colorable Part I: Discharging, Illinois J. Math.,21(1977), pp. 429–490.

    MATH  MathSciNet  Google Scholar 

  4. K. Appel, W. Haken and J. Koch, Every planar map is four colorable Part II: Reducibility, Illinois J. Math.21(1977), pp. 491–567.

    MATH  MathSciNet  Google Scholar 

  5. K. Appel and W. Haken, The solution of the four-color-map problem, Scientific American, September 1977, pp. 108–121.

  6. G. D. Birkhoff, The reducibility of maps, Amer. J. Math.,35(1913), pp. 114–128.

    Article  MathSciNet  Google Scholar 

  7. K. Dürre, H. Heesch and F. Miehe, Eine Figurenliste zur chromatischen Reduktion, Technische Universität Hannover, Institut für Mathematik, 1977, Nr. 73.

  8. H. Heesch, Untersuchungen zum Vierfarbenproblem, B-I-Hochschulscripten 810/810a/810b, Bibliographisches Institut, Mannheim/Vienna/Zurich, 1969.

    Google Scholar 

  9. H. Heesch, Chromatic reduction of the triangulations Te, e = e5 + e7, J. Combinatorial Theory,13(1972), pp. 46–53.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. B. Kempe, On the geographical problem of the four colors, Amer. J. Math.,2(1879), pp. 193–200.

    Article  MathSciNet  Google Scholar 

  11. U. Schmidt, Überprüfung des Beweises für den Vierfarbensatz. Diplomarbeit, Technische Hochschule Aachen, 1982.

  12. W. Stromquist, Some aspects of the four color problem, Ph.D. Thesis, Harvard University, 1975.

  13. W. Tutte and H. Whitney, Kempe chains and the four color problem, Utilitas Math.2(1972), pp. 141–281.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Appel, K., Haken, W. The four color proof suffices. The Mathematical Intelligencer 8, 10–20 (1986). https://doi.org/10.1007/BF03023914

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03023914

Keywords

Navigation