New Giant Configuration Proof Revalidates Four-Color Theorem and Speeds Graph Coloring
A Danish-led team produced a new computer-assisted proof of the four-color theorem using 8,202 reducible configurations, yielding a parallel coloring method with n log n time and offering fresh insights into planar graphs and potential extensions to other surfaces.