Running summarizing tools on a new article
Check the paper below, then start its synthesis.
An unavoidable set of D-reducible configurations
John Steinberger
arXiv: 0905.0043v1 (math.CO)
License: NONEXCLUSIVE-DISTRIB 1.0
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.
Submitted to arXiv on 01 May. 2009