Planar Graphs · Coloring of Planar Graphs
Lesson 2
As of today, it is known that any planar graph is 4-colorable.

The proof of this fact was constructed with the help of a computer, which checked a large number of cases. A simple proof not using such case-checking (which was done by computer) is still not known.
A later proof by Robertson, Sanders, Seymour, and Thomas made the argument substantially cleaner and reduced the computer part to checking 633 configurations. However, this proof still relies on computer verification, so a purely hand-checkable proof is still not known. In 2005, Georges Gonthier and Benjamin Werner gave a formally verified proof in the Coq proof assistant. This increased confidence in the result, but it is still a computer-assisted proof rather than a traditional proof that can be checked entirely by hand.For the curious 🤓
Screenshot from Knuth's «The Art of Computer Programming»:
