The University of Southampton
University of Southampton Institutional Repository

A proof of the four-colour theorem

A proof of the four-colour theorem
A proof of the four-colour theorem
The four-colour problem remained unsolved for more than a hundred years has played a role of the utmost importance in the development of graph theory. The four-colour theorem was confirmed in 1976, which is not completely satisfied due to: i) part of the proof using computers cannot be verified by hand; ii) even the part, supposedly hand-checkable, is extraordinarily complicated and tedious, and as far as we know, no one has entirely verified it. Seeking a hand-checkable proof of the four-colour theorem is one of world-interested problems, which is addressed in this paper. A necessary and sufficient condition for n-colour theorem in a space is: there exists a largest n-complete graph base in the same space. Examples are given to illustrate applications.
four colour theorem, hand-checkable proof, graph theory
University of Southampton
Xing, Jing Tang
d4fe7ae0-2668-422a-8d89-9e66527835ce
Xing, Jing Tang
d4fe7ae0-2668-422a-8d89-9e66527835ce

Xing, Jing Tang (2013) A proof of the four-colour theorem Southampton, GB. University of Southampton 13pp.

Record type: Monograph (Discussion Paper)

Abstract

The four-colour problem remained unsolved for more than a hundred years has played a role of the utmost importance in the development of graph theory. The four-colour theorem was confirmed in 1976, which is not completely satisfied due to: i) part of the proof using computers cannot be verified by hand; ii) even the part, supposedly hand-checkable, is extraordinarily complicated and tedious, and as far as we know, no one has entirely verified it. Seeking a hand-checkable proof of the four-colour theorem is one of world-interested problems, which is addressed in this paper. A necessary and sufficient condition for n-colour theorem in a space is: there exists a largest n-complete graph base in the same space. Examples are given to illustrate applications.

Text
4colourtheoremJTX2013.pdf - Other
Download (270kB)

More information

Published date: 18 September 2013
Keywords: four colour theorem, hand-checkable proof, graph theory
Organisations: Fluid Structure Interactions Group

Identifiers

Local EPrints ID: 356984
URI: http://eprints.soton.ac.uk/id/eprint/356984
PURE UUID: 514d4e71-2980-47d1-8bcc-cfca38e4db3f

Catalogue record

Date deposited: 14 Oct 2013 10:58
Last modified: 11 Dec 2021 02:54

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×