A Simple Proof of the Four-Color Theorem

Details A Simple Proof of the Four-Color Theorem A Simple Proof of the Four-Color Theorem

2002-07-06

arxiv.org/abs/math/0207061v1

Mathematics

General Mathematics

4pages, 2 figures

Scientific paper

A simpler proof of the four color theorem is presented. The proof was reached using a series of equivalent theorems. First the maximum number of edges of a planar graph is obatined as well as the minimum number of edges for a complete graph. Then it is shown that for the theorem to be false there must exist a complete planar graph of $h$ edges such that $h>4$. Finally the theorem is proved to be true by showing that there does not exist a complete planar graph with $h>4$.

Affiliated with

Also associated with

No associations

Rating

A Simple 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 Simple 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 Simple Proof of the Four-Color Theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-666024