A formal proof of the four color theorem
| dc.creator | Xiang, Limin | |
| dc.date | 2009-05-22 | |
| dc.date | 2009-05-27 | |
| dc.date.accessioned | 2026-07-07T13:18:07Z | |
| dc.date.available | 2026-07-07T13:18:07Z | |
| dc.description | 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. | |
| dc.description | 9 pages, 2 Figures | |
| dc.identifier | https://arxiv.org/abs/0905.3713 | |
| dc.identifier | http://arxiv.org/abs/0905.3713 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/231329 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | G.2.2 | |
| dc.title | A formal proof of the four color theorem | |
| dc.type | text |