weaker five color theorem was proven already in the 1800s, the four color theorem resisted until 1976 when it was proven by Kenneth Appel and Wolfgang Haken in a computer-aided proof. This came after many false proofs and mistaken counterexamples in the preceding decades.

The Appel-Haken proof proceeds by analyzing a very large number of "reducible configurations", examples of maps with a particular property.