Ken-ichi Kawarabayashi

New Capabilities

Co-led the new proof; supervised graduate students who ran months of computation

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