Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-05T04:24:43.371Z Has data issue: false hasContentIssue false
  • English
  • Français

The complexity of the four colour theorem

Part of: Computational number theory Computability and recursion theory

Published online by Cambridge University Press:  01 August 2010

Cristian S. Calude  and
Elena Calude
Cristian S. Calude
Affiliation:
Department of Computer Science, The University of Auckland, Private Bag 92019, Auckland, New Zealand (email: [email protected])http://www.cs.auckland.ac.nz/∼cristian
Elena Calude
Affiliation:
Institute of Information and Mathematical Sciences, Massey University at Albany, Private Bag 102-904, North Shore MSC, New Zealandhttp://www.massey.ac.nz/∼ecalude

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The four colour theorem states that the vertices of every planar graph can be coloured with at most four colours so that no two adjacent vertices receive the same colour. This theorem is famous for many reasons, including the fact that its original 1977 proof includes a non-trivial computer verification. Recently, a formal proof of the theorem was obtained with the equational logic program Coq [G. Gonthier, ‘Formal proof–the four color theorem’, Notices of Amer. Math. Soc. 55 (2008) no. 11, 1382–1393]. In this paper we describe an implementation of the computational method introduced by C. S. Calude and co-workers [Evaluating the complexity of mathematical problems. Part 1’, Complex Systems 18 (2009) 267–285; A new measure of the difficulty of problems’, J. Mult. Valued Logic Soft Comput. 12 (2006) 285–307] to evaluate the complexity of the four colour theorem. Our method uses a Diophantine equational representation of the theorem. We show that the four colour theorem is in the complexity class ℭU,4. For comparison, the Riemann hypothesis is in class ℭU,3 while Fermat’s last theorem is in class ℭU,1.

MSC classification

Secondary: 03D15: Complexity of computation (including implicit computational complexity) 11Y16: Algorithms; complexity
Type
Research Article
Information
LMS Journal of Computation and Mathematics , Volume 13 , January 2010 , pp. 414 - 425
Copyright
Copyright © London Mathematical Society 2010

References

[1] Appel, K. and Haken, W., ‘Every planar map is four-colorable, II: reducibility’, Illinois J. Math. 21 (1977) 491–567.Google Scholar
[2] Appel, K., Haken, W. and Koch, J., ‘Every planar map is four colourable, I: discharging’, Illinois J. Math. 21 (1977) 429–490.Google Scholar
[3] Calude, A. S., ‘The journey of the four colour theorem through time’, NZ Math. Magazine 38 (2001) no. 3, 27–35.Google Scholar
[4] Calude, C. S., Information and randomness: an algorithmic perspective, 2nd edn (Springer, Berlin, 2002) revised and extended.CrossRefGoogle Scholar
[5] Calude, C. S. and Calude, E., ‘Evaluating the complexity of mathematical problems. Part 1’, Complex Systems 18 (2009) 267–285.CrossRefGoogle Scholar
[6] Calude, C. S. and Calude, E., ‘Evaluating the complexity of mathematical problems. Part 2’, Complex Systems 18 (2010) 387–401.CrossRefGoogle Scholar
[7] Calude, C. S., Calude, E. and Dinneen, M. J., ‘A new measure of the difficulty of problems’, J. Mult. Valued Logic Soft Comput. 12 (2006) 285–307.Google Scholar
[8] Calude, C. S., Calude, E. and Marcus, S., ‘Passages of proof’, Bull. EATCS 84 (2004) 167–188.Google Scholar
[9] Calude, C. S., Calude, E. and Marcus, S., ‘Proving and programming’, Randomness & complexity, from Leibniz to Chaitin (ed. Calude, C. S.; World Scientific, Singapore, 2007) 310–321.CrossRefGoogle Scholar
[10] Calude, C. S., Dinneen, M. J. and Shu, C.-K., ‘Computing a glimpse of randomness’, Experiment. Math. 11 (2002) no. 2, 369–378.CrossRefGoogle Scholar
[11] Calude, E., ‘The complexity of the Goldbach’s conjecture and Riemann’s hypothesis’, CDMTCS Research Report 369, 2009, 14 pp.Google Scholar
[12] Chaitin, G. J., Algorithmic information theory (Cambridge University Press, Cambridge, 1987) third printing 1990.CrossRefGoogle Scholar
[13] Davis, M., Matijasevič, Y. V. and Robinson, J., ‘Hilbert’s tenth problem. Diophantine equations: positive aspects of a negative solution’, Mathematical developments arising from Hilbert problems (ed. Browder, F. E.; American Mathematical Society, Providence, RI, 1976) 323–378.CrossRefGoogle Scholar
[14] Gonthier, G., ‘Formal proof—the four color theorem’, Notices Amer. Math. Soc. 55 (2008) no. 11, 1382–1393.Google Scholar
[15] Marcus, S., ‘Mathematics through the glasses of Hjelmslev’s semiotics’, Semiotica 145–1/4 (2003) 235–246.Google Scholar
[16] Robertson, N., Sanders, D. P., Seymour, P. and Thomas, R., ‘The four color theorem’, http://www.math.gatech.edu/∼thomas/FC/fourcolor.html (accessed 30 November 2008).Google Scholar
[17] Wilson, R., Four colours suffice (Penguin, London, 2002).Google Scholar