论文信息 - A new proof of the four-colour theorem

A new proof of the four-colour theorem

The four-colour theorem, that every loopless planar graph admits a vertex-colouring with at most four different colours, was proved in 1976 by Appel and Haken, using a computer. Here we announce another proof, still using a computer, but simpler than Appel and Haken’s in several respects.

P. Seymour | N. Robertson | Robin Thomas | Daniel P. Sanders | R. Thomas

[1] A. Kempe. On the Geographical Problem of the Four Colours , 1879 .

[2] Tait. XXIII.—Note on a Theorem in Geometry of Position. , 1880 .

[3] George D. Birkhoff,et al. The Reducibility of Maps , 1913 .

[4] P. Hall. On Representatives of Subsets , 1935 .

[5] E. Witt,et al. Die 5-fach transitiven gruppen von mathieu , 1937 .

[6] Arthur Bernhart. Another Reducible Edge Configuration , 1948 .

[7] J. Rotman. An Introduction to the Theory of Groups , 1965 .

[8] Heinrich Heesch,et al. Untersuchungen zum Vierfarbenproblem , 1969 .

[9] K. Appel,et al. Every planar map is four colorable. Part II: Reducibility , 1977 .

[10] K. Appel,et al. Every planar map is four colorable. Part I: Discharging , 1977 .

[11] Frank Allaire,et al. A systematic approach to the determination of reducible configurations in the four-color conjecture , 1978, J. Comb. Theory, Ser. B.

[12] L. Ahlfors. Complex Analysis , 1979 .

[13] K. Appel,et al. Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.

[14] Tsit Yuen Lam,et al. A first course in noncommutative rings , 2002 .

[15] Hassler Whitney,et al. Kempe Chains and the Four Colour Problem , 1992 .

[16] Richard M. Wilson,et al. A course in combinatorics , 1992 .

[17] Split extensions and representations of moufang loops , 1995 .

[18] Robin Thomas,et al. The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.