An unavoidable set of D-reducible configurations

DOI10.1090/S0002-9947-2010-05092-5MaRDI QIDQ3065754zbMATHFDO

Authors John P. Steinberger

Publication date 6 January 2011

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0905.0043

zbMATH Keywords

graph theoryfour-color theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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.

Recommendations

• Every Planar Map is Four Colorable
• scientific article; zbMATH DE number 140087
• scientific article; zbMATH DE number 1196612
• scientific article; zbMATH DE number 1021588
• scientific article; zbMATH DE number 4033776

Cites work

• scientific article; zbMATH DE number 140087 (Why is no real title available?)
• scientific article; zbMATH DE number 3513805 (Why is no real title available?)
• scientific article; zbMATH DE number 1196612 (Why is no real title available?)
• scientific article; zbMATH DE number 3797779 (Why is no real title available?)
• scientific article; zbMATH DE number 3298600 (Why is no real title available?)
• Another Reducible Edge Configuration
• Every Planar Map is Four Colorable
• Every planar map is four colorable. I: Discharging
• Formal proof - the four color theorem
• The four-color theorem for small maps
• The four-colour theorem

Cited in

(5)

• Subcubic planar graphs of girth 7 are class I
• scientific article; zbMATH DE number 140087 (Why is no real title available?)
• scientific article; zbMATH DE number 4033776 (Why is no real title available?)
• Irreducibility of configurations
• The \(a\)-graph coloring problem

This page was built for publication: An unavoidable set of \(D\)-reducible configurations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065754)