Four Color Theorem in Near-Linear Time: The 2026 Paper Explained
Four color theorem, 2026: a FOCS paper 4-colors any planar graph in O(n log n), down from O(n²). How it works, and how 3 AI agents re-ran its proof checks.
Four color theorem, 2026: a FOCS paper 4-colors any planar graph in O(n log n), down from O(n²). How it works, and how 3 AI agents re-ran its proof checks.