A Human-Checkable Four-Color Theorem Proof
Andr\'e Luiz Barbosa

TL;DR
This paper introduces a concise, human-verifiable proof of the Four-Color Theorem, eliminating the need for computer verification and making the proof accessible for manual checking.
Contribution
It provides a novel, human-checkable proof of the Four-Color Theorem, differing from previous computer-assisted proofs.
Findings
Proof is short and simple enough for human verification
Key idea enables human-checkable verification
Global structure of proof is clearly presented
Abstract
This paper presents a short and simple proof of the Four-Color Theorem that can be utterly checkable by human mathematicians, without computer assistance. The new key idea that has allowed it and the global structure of the proof are presented in the Introduction.
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.
Taxonomy
TopicsTopological and Geometric Data Analysis · Advanced Graph Theory Research · Graph Labeling and Dimension Problems
