Quanta Magazine · Science

New Computer Proof for the Four-Color Theorem Offers Efficiency Gains

Mathematicians have developed a new computer-assisted proof for the four-color theorem, which states that any map can be colored using only four colors such that no adjacent regions share the same color. This latest proof, while complex, provides a more efficient method for coloring maps and offers new insights into graph theory.

The four-color theorem has seen numerous flawed proofs since the 19th century. The first accepted proof in 1976 by Appel and Haken was controversial due to its computer reliance. A simplified computer proof in 1997 gained wider acceptance.

The latest proof, by Thorup, Thomassen, and colleagues, also uses computers. It was posted online in March 2026. While intricate, it offers a more efficient coloring method, reducing steps from n² to n(log n) for a graph with n vertices.

The researchers focused on configurations in 'flat areas' of planar graphs. This approach, though computationally intensive, allowed for parallel reduction of configurations, leading to improved efficiency.

Beyond the theorem, the new proof uncovers structural properties of planar graphs. These insights could aid in solving other graph theory problems, including those on different surfaces.

Despite the new proof, the quest for a simpler, non-computer-assisted explanation continues. Researchers aim for a more theoretical solution that explains why four colors suffice.

AI-samenvatting op basis van de bron.