Mathematics – Combinatorics
Scientific paper
2004-08-27
Mathematics
Combinatorics
7 pages, 3 figures. Some text corrections in the first step of the proof. The second step is re-formulated as a counterexample
Scientific paper
The essential idea described in this paper is to use induction in order to prove for triangulations a sharper version of the 4-colour theorem: in addition to 4-colourability, the existence of a special colouring is claimed in which the special case (in terms of Kempe chains in the exterior of a 5-cycle) leading to the failure of Kempe's proof attempt does not exist. If this case is assumed to exist, a contradiction can be constructed in a surprisingly trivial way by using Jordan's curve theorem.
No associations
LandOfFree
Yet a short proof of the 4-colour theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Yet a short proof of the 4-colour theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Yet a short proof of the 4-colour theorem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-211180