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
- EASE: evidence-anchored spatial attention lifts multimodal RLVR by up to 3.1 points, EMNLP 2026 — jiqizhixin · 2026-09-11
- P=NP Explained: Why Class Schedules and Circuit Routing Are the Real Hard Problems — thesaraharminta · 2026-09-11
- Hypothesis: ASI Has a Mathematical Incentive to Preserve Human Diversity — No_Cause_2731 · 2026-09-11
- MutexaGPT: LLM agents plus MD simulations hit 40% on enzyme design, 4x the baseline — bravo_abad · 2026-09-11
- Single-author ECCV 2026 paper makes rolling shutter correction practical — ducha_aiki · 2026-09-11
- MetroLLM-Bench shows small fine-tuned models can match larger LLMs on transit-kiosk tasks — continker · 2026-09-11