Proof of the 4-Color Theorem
Yan Xian · 2003
Prove the 4-color conjecture by graph theory in the discrete mathematics. By skillfully using mathematics induction and interchanging-colors, this article successfully solves the simplifying prohlem advanced by A. Kempe more than one hundred years ago, which says there exists the region adjacent to five neighboring regions in the unavoidable structures group. Besides, the artide points out that, the example of the 25 orders illustrated by P. Heawood in 1890, which shows a 5-color theorem is correct, while the 4-color conjecture is not, is similar to a typical illustration in the article. But different from the former, the article simply and ideally infers that the 4-color problem holds by making full use of the illustration in interchanging colors. That shows the proof in the article is complete and scientific.