Reducibility in the Four-Color Theorem
Combinatorics
2014-01-28 v1 Discrete Mathematics
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.
Cite
@article{arxiv.1401.6481,
title = {Reducibility in the Four-Color Theorem},
author = {Neil Robertson and Daniel P. Sanders and Paul Seymour and Robin Thomas},
journal= {arXiv preprint arXiv:1401.6481},
year = {2014}
}
Comments
8 pages, 2 ancillary files. These files were originally posted on an anonymous ftp server and later (after the server's shutdown) were relocated to the last author's website