The Four-Color Theorem Gets a Rare New Proof

The four-color theorem asks whether any map drawn on a flat surface can be colored using only four colors so that no two neighboring regions share the same color. This problem, first noticed in 1852 by mathematician Francis Guthrie, seems straightforward but has baffled experts for over a century. The theorem applies to planar graphs, which are mathematical representations of maps where regions become vertices (points) and borders become edges (lines connecting points). For example, a map of Europe can be converted into a planar graph where countries like France and Germany are vertices connected by an edge. The goal is to assign one of four colors to each vertex so no two connected vertices share a color. Despite its simplicity, proving this theorem required decades of work and, eventually, the use of computers.

The first attempt to prove the four-color theorem was made in 1879 by Alfred Bray Kempe, who introduced the idea of unavoidable sets and reducible configurations. An unavoidable set is a group of graph structures that must appear in any map, while a reducible configuration is a structure that can be simplified without affecting the overall coloring. Kempe’s proof relied on a method called Kempe chains, where colors are swapped to resolve conflicts. However, in 1890, Percy John Heawood discovered a flaw in Kempe’s approach, showing that his method failed for certain configurations. Despite this setback, Kempe’s ideas laid the foundation for future proofs. Over the next 80 years, many mathematicians, including lawyers and doctors, attempted to solve the problem, but all failed to produce a valid proof.

In 1976, mathematicians Kenneth Appel and Wolfgang Haken finally proved the four-color theorem, but their solution was controversial because it relied heavily on computers. They reduced the problem to checking 1,482 configurations, which required a supercomputer to verify. This approach was met with skepticism because computers at the time were less reliable, and the proof was too complex for humans to verify manually. The mathematical community gradually accepted the result, and in 1997, a simpler computer-assisted proof reduced the number of configurations to 633. While these proofs were groundbreaking, they did not provide a deeper understanding of why the theorem holds true, leaving mathematicians dissatisfied and eager for a more elegant solution.

In March 2026, a team of mathematicians including Mikkel Thorup, Carsten Thomassen, Ken-ichi Kawarabayashi, and Bojan Mohar published a new proof of the four-color theorem. Unlike previous proofs, this one focused on flat regions of planar graphs, where each vertex connects to six others in a triangular pattern. These regions are more common but harder to analyze. The team identified 8,202 configurations that could be reduced simultaneously, allowing for a much faster coloring algorithm. For a graph with n vertices, the new method requires n(log n) steps, a significant improvement over the n² steps needed by earlier computer proofs. This approach not only proved the theorem but also revealed new structural properties of planar graphs.

The new proof of the four-color theorem has implications beyond map coloring. It provides mathematicians with tools to study planar graphs and other types of graphs, such as those on toroidal surfaces (doughnut-shaped surfaces). The techniques developed by the team can be applied to other problems in graph theory, including coloring graphs on different surfaces. For example, graphs on a torus may require more than four colors, but the methods used in the new proof could help determine the minimum number needed. The research also highlights the ongoing debate about the role of computers in mathematical proofs, as the team’s work demonstrates how computational methods can uncover deeper theoretical insights.