基于三段论的四色猜想证明
首发时间:2005-09-28
摘要:首先提出一个三段论:所有极大平面图的最小色数不大于4,所有子图的最小色数不大于其基础图的最小色数,因为任一平面图都是极大平面图的子图,所以任一平面图的最小色数也不大于4;然后证明了三段论的大前提和小前提的正确性,并且根据三段论得出四色猜想成立的结论。
For information in English, please click here
A Syllogism-Based Proof of the Four-Color Guess
Abstract:Firstly, a syllogism was presented to demonstrate the four-color guess. The major premise is that all maximum planar graph’s minimum color-number are not bigger than 4, and all the children’s minimum color-number is not bigger than their father’s minimum color-number. The minor premise is that each planar graph is a child graph of a maximum planar graph. The conclusion is the minimum color-number of every planar graph will not bigger than 4. Secondly, the major premise and the minor premise were demonstrated. Lastly, the four color guess was proved by the syllogism.
Keywords: four-color guess ;child graph ;maximum planar graph ;syllogism
基金:
论文图表:
引用
No.3058297391127871****
同行评议
共计0人参与
勘误表
基于三段论的四色猜想证明
评论
全部评论