Why Kempe's "Proof" of the Four-Color Theorem Fails — Visualized in 6 Minutes

The four-color theorem says every plane graph can be colored with at most four colors. In 1879 Alfred Kempe published a proof that was accepted for over a decade — until Percy Heawood found a fatal gap. This video visualizes Kempe's argument step by step and shows exactly where it breaks down. The theorem itself is true (finally proved by Appel and Haken in 1976), but Kempe's chain idea lives on — in that proof and in the five-color theorem. In this video, we visualize: The induction setup and the easy cases (degree 3 and 4) Kempe chains, and how recoloring frees up a color The degree-5 case that looks like a valid proof The counterexample where two chains cross — and the swap fails Animated with Manim, with English narration. Chapters: 0:00 Introduction 0:15 The four-color theorem 0:31 Plane graphs and colorings 0:49 The proof by induction 1:02 Degree 3: the easy case 1:30 Degree 4: Kempe chains 2:34 Degree 5: the hard case 4:16 Where the proof breaks 5:32 Kempe's legacy Follow us on X: https://x.com/graphgarden01 #GraphTheory #Mathematics #FourColorTheorem #KempeChains #ComputerScience