An unavoidable set of D-reducible configurations
Combinatorics
2015-03-13 v3
Abstract
We give a new proof of the four-color theorem by exhibiting an unavoidable set of 2822 D-reducible configurations. The existence of such a set had been conjectured by several researchers including Stromquist, Appel and Haken, and Robertson, Sanders, Seymour and Thomas.
Keywords
Cite
@article{arxiv.0905.0043,
title = {An unavoidable set of D-reducible configurations},
author = {John Steinberger},
journal= {arXiv preprint arXiv:0905.0043},
year = {2015}
}