An unavoidable set of D-reducible configurations
John Steinberger
TL;DR
This paper presents a new proof of the four-color theorem by identifying an unavoidable set of 2822 D-reducible configurations, confirming longstanding conjectures in graph theory.
Contribution
It introduces a verified set of D-reducible configurations that serve as a key component in a novel proof of the four-color theorem.
Findings
Existence of an unavoidable set of 2822 D-reducible configurations
Confirmation of longstanding conjectures about unavoidable sets
New proof of the four-color theorem
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.