Mathematicians Crack Four-Color Problem With New Algorithm

An international team, including two Danish professors, has developed an optimal algorithm for coloring any map with four colors.

Updated on Nov. 17, 2026 in Mathematics

Flat-color vector editorial illustration of four regions tiled in red, teal, mustard, and cream beside a plain unlabeled graph of dots and edges.
International mathematicians, including two Danish professors, developed an optimal algorithm that four-colors any map, resolving a question first raised in 1852. AI Illustration. Upload story photo >

International mathematicians, including two Danish professors, have developed an optimal algorithm for four-coloring any map. The breakthrough resolves a question first raised in 1852 by Francis Guthrie.

Why it matters

The new algorithm reduces computation time from quadratic to linear, making the four-color solution practical for much larger maps than earlier computer-driven proofs allowed. The advance rests on a newly discovered insight that planar graphs contain far more reducible configurations than previously thought.

The new algorithm's runtime scales linearly rather than quadratically, with a map 10 times larger slowing it about 10 times versus about 100 times for the previous method. The source does not report independent verification of the result beyond the award-winning first paper.

The players

University of Copenhagen

The University of Copenhagen is Denmark's oldest and largest university, founded in 1479 and known for its research in the natural sciences.

Technical University of Denmark (DTU)

The Technical University of Denmark is a leading Scandinavian research university focused on engineering, technology and the natural sciences.

The details

The team discovered that planar graphs contain far more reducible configurations than previously thought, and these configurations can be found in many places in a graph to determine the coloring. The approach follows a 1997 proof that was computationally slow for large maps, and an earlier 1976 complete proof that relied on extensive computer calculations.

Timeline

  1. 1852: Francis Guthrie first raised the four-color question.

  2. 1879: The first proof of the four-color problem was presented; it stood 11 years before an error was found.

  3. 1976: A complete computer-assisted proof was published.

  4. 1997: A new, more straightforward proof was presented.

  5. November 17, 2026: The University of Copenhagen announced the new algorithm.

The Big Picture

The new method extends the 1976 computer-assisted proof of the four-color theorem by replacing its slow computations with a linear-time approach. It shifts the field from brute-force verification toward structural insights about planar graphs.

The faster algorithm could make computer-verified map coloring practical for much larger graphs, with applications in areas that rely on graph coloring such as scheduling and network design. Commercialization timelines are not reported in the source.

The takeaway

Problems that resisted proof for over 170 years can yield to new structural insights rather than just more computing power. The advance shows that the right mathematical idea can transform an approach that once seemed fixed.

Further reading

Explore more mathematics research on the four-color problem and related graph theory breakthroughs.

Source note: This article includes information reported by TechSavvy.