2014/01/25 by Neil Robertson, Robertson, Neil, Daniel P. Sanders +5
Computer Science · Mathematics · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Mathematics and Applications #cs.DM #math.CO
paper · pdf · doi:10.48550/arxiv.1401.6485
22 pages, 9 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
arxiv created 2014/01/25 · openalex publication_date 2014/01/25 · arxiv updated 2014/01/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.