Blueprint for a Classic Proof of the Four Colour Theorem

Details Blueprint for a Classic Proof of the Four Colour Theorem Blueprint for a Classic Proof of the Four Colour Theorem

2008-01-30

arxiv.org/abs/0802.1535v3

Mathematics

General Mathematics

14 pages, 8 colourfull illustrations. The hocus-pocus of the trio's is replaced by an oriented pairs invariance

Scientific paper

The proof uses the property that the vertices of a triangulated planar graph can be four coloured if the triangles can have a +1 or -1 orientation so that the sum of the triangle orientations around each vertex is a multiple of 3. Such orientation is first used separately on one of the two triangulated polygons resulting from a Hamilton circuit in a triangulated planar graph with v vertices. The graph is then reconstructed by adding the triangles of the other polygon one by one. When the graph is totally reconstructed there is always a combination for the orientations of the triangles for which their sum around each of v-2 successive vertices in the Hamilton circuit is a multiple of 3. It is then provable that the sum of the triangle orientations around the two remaining vertices must also be a multiple of 3.

Affiliated with

Also associated with

No associations

Rating

Blueprint for a Classic Proof of the Four 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 Blueprint for a Classic Proof of the Four Colour Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Blueprint for a Classic Proof of the Four Colour Theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-122435