An unavoidable set of D-reducible configurations

2009/05/01 by John Steinberger, Steinberger, John
Mathematics · #05C15 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C15

paper · pdf · doi:10.48550/arxiv.0905.0043

arxiv created 2009/05/04 · arxiv updated 2015/03/13

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.

Related

• A new way to prove configuration reducibility using gauge theory
• Mathematical Proofs of Two Conjectures: The Four Color Problem and The Uniquely 4-colorable Planar Graph
• The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
• Reducibility in the Four-Color Theorem
• A Mathematical Proof of the Four-Color Conjecture (1): Transformation Step