Exécution de notre outil de synthèse sur un nouvel article
Vérifiez l’article ci-dessous, puis lancez sa synthèse.
An unavoidable set of D-reducible configurations
John Steinberger
arXiv: 0905.0043v1 (math.CO)
Licence : NONEXCLUSIVE-DISTRIB 1.0
Résumé : 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.
Soumis à arXiv le 01 Mai. 2009