Computer scientist at Inria in Paris
Appears in 1 story
Commenting on the new proof; led prior formal verification of the four-color theorem
The four-color theorem says any map can be colored with four colors so no neighboring regions match. A team of six mathematicians posted a new proof in March 2026 that colors any planar graph in near-linear time, down from quadratic in the previous accepted proof.
Updated 3 hours ago
No stories match your search
Try a different keyword
How would you like to describe your experience with the app today?
