Abstract | ||
---|---|---|
In [J. Combin. Theory Ser. B 70 (1997), 2-44] we gave a simplified proof of the Four-Color Theorem. The proof is computer-assisted in the sense that for two lemmas in the article we did not give proofs, and instead asserted that we have verified those statements using a computer. Here we give additional details for one of those lemmas, and we include the original computer programs and data as "ancillary files" accompanying this submission. |
Year | Venue | Field |
---|---|---|
2014 | CoRR | Discrete mathematics,Combinatorics,Four color theorem,Mathematical proof,Mathematics,Lemma (mathematics) |
DocType | Volume | Citations |
Journal | abs/1401.6481 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Neil Robertson | 1 | 524 | 78.85 |
Daniel P. Sanders | 2 | 471 | 45.56 |
Paul D. Seymour | 3 | 2786 | 314.49 |
Robin Thomas | 4 | 457 | 35.92 |