A formal proof of the four color theorem

Details A formal proof of the four color theorem A formal proof of the four color theorem

2009-05-22

arxiv.org/abs/0905.3713v2

Computer Science

Discrete Mathematics

9 pages, 2 Figures

Scientific paper

A formal proof has not been found for the four color theorem since 1852 when Francis Guthrie first conjectured the four color theorem. Why? A bad idea, we think, directed people to a rough road. Using a similar method to that for the formal proof of the five color theorem, a formal proof is proposed in this paper of the four color theorem, namely, every planar graph is four-colorable. The formal proof proposed can also be regarded as an algorithm to color a planar graph using four colors so that no two adjacent vertices receive the same color.

Affiliated with

Also associated with

No associations

Rating

A formal proof of the four color 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 A formal proof of the four color theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A formal proof of the four color theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-325778