A shorter proof of the Four Colour Theorem
Carl Feghali

TL;DR
This paper presents a simplified, more accessible proof of the Four Colour Theorem, reducing complexity and making the theorem easier to verify without extensive computational methods.
Contribution
It introduces a shorter, more straightforward proof of the Four Colour Theorem, improving upon previous complex proofs.
Findings
Proof is simpler and more accessible
Verification requires less computational effort
The theorem is confirmed with a more concise argument
Abstract
We give a pen and paper and (comparatively) much simpler proof to verify of the Four Colour Theorem.
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
Topicsgraph theory and CDMA systems · Graph Labeling and Dimension Problems
