A pictorial proof of the Four Colour Theorem

TL;DR

This paper presents a visual proof of the Four Colour Theorem, demonstrating why four colours suffice for any planar map and explaining why traditional graph theory approaches are insufficient.

Contribution

It introduces a novel pictorial proof that visually explains the theorem and clarifies its limitations within classical graph theory.

Findings

No minimal planar map exists for four-colourability

Visual proof clarifies the theorem's rationale

Explains why classical graph theory cannot fully express the proof

Abstract

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.