A pictorial proof of the Four Colour Theorem
Bhupinder Singh Anand · arXiv (Cornell University) · 2021
We give a pictorial proof that transparently illustrates why four colours suffce to chromatically differentiate any set of contiguous, simply connected and bounded, planar spaces; by showing that there is no minimal planar map. We show, moreover, why the proof cannot be expressed within classical graph theory.