The Four-Color Theorem Gets a Rare New Proof
pavel_lishin · hn · 2026-09-10
Quanta Magazine reports that the famous four-color theorem — any planar map needs only four colors so adjacent regions differ — has received a rare new proof. First proven in 1976 by Appel and Haken with heavy computer assistance, a milestone that long stirred controversy, the theorem now has a fresh take that revisits one of math's landmark computer-assisted results. Details in the Quanta article.
More from Research
- HarnessMM cuts agent tokens per task by up to 88% while raising success rates — omarsar0 · 2026-10-26
- Ben Recht: The world needs a truly open language model, and it's easier to build than you think — beenwrekt · 2026-10-26
- New Blog Breaks Black-Box Distillation Into Five Practical Steps — chrisrohlf · 2026-10-26
- DetectorScope turns black-box AI text detectors into auditable ones with sparse autoencoders — _akhaliq · 2026-10-26
- OPST paper shows LLMs self-improve with zero human data, guided only by topic descriptions — _akhaliq · 2026-10-26
- Tencent's HiSTEVE 1.0: hierarchical VLA agent plays Minecraft with native keyboard and mouse, hits 85% SOTA — _akhaliq · 2026-10-26