Theorem

Five Color Theorem

Combinatorics and Graph Theory

The five color theorem, in graph theory, states that the regions of any planar map, such as a political map, can be colored with at most five colors so that no two regions sharing a border of positive length receive the same color. Percy John Heawood proved it in 1890, building on techniques from Alfred Kempe's flawed 1879 attempt to prove the stronger four color theorem, whose error was not found for eleven years and which was not rigorously settled until 1976. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Facts

Classification

Statement Form

Existence Theorem 1

Proof Year

1890 1

Connections

Has Statement Form

Existence Theorem

Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.

In Branch

Graph Theory

Source Five color theorem (Wikipedia)

Sources

1. Five color theorem (Wikipedia)

Lead paragraph
It was first proved by Percy John Heawood in 1890
In Branch: Graph Theory, Lead sentence
The five color theorem is a result from graph theory that given a plane separated into regions, such as a political map of the cou

Switch Atlas

The Inner World

The Civil World

The Natural World

Five Color Theorem

Has Statement Form

In Branch