基于三段论的四色猜想证明

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.