The four color theorem
- topology
- american
Kenneth Appel and Wolfgang Haken announced a proof of the four-color theorem in 1976. The theorem states, in the appropriate mathematical setting, that regions of a planar map can be colored with four colors so adjacent regions receive different colors. Their argument reduced the problem to a finite collection of configurations and used computer calculations to check the required cases. This made the status and verification of machine-assisted proof a major topic of discussion. Later proofs and formal verification changed the checking arrangements, but do not erase the importance of this original computational milestone. **Timeline anchor:** 1 January 1976 CE. **References:** [Source 1](https://en.wikipedia.org/wiki/Four_color_theorem).
Sources
Related
On other timelines
- The four colour theorem in Coq on Type theory and functional programming: a history by @athan
- A Coq development checks the four-colour theorem on Type theory · foundations, languages, proof assistants and program logics by @athan