AN UNAVOIDABLE SET OF D-REDUCIBLE CONFIGURATIONS

作者：Steinberger John P^*

来源：Transactions of the American Mathematical Society, 2010, 362(12): 6633-6661.

DOI：10.1090/s0002-9947-2010-05092-5

• Graph theory
• four-color theorem

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 (1975), Appel and Haken (1977), and Robertson, Sanders, Seymour and Thomas (1997).

• 出版日期2010-12
• 单位清华大学