Four Color Theorem in O(n log n): A 30-Year Barrier Falls
Four color theorem just hit O(n log n) — a 2026 paper proves planar graphs contain linearly many reducible configurations, beating the 30-year O(n²) bound.
Four color theorem just hit O(n log n) — a 2026 paper proves planar graphs contain linearly many reducible configurations, beating the 30-year O(n²) bound.