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.
Facts
Proof Method Classification
Statement Form Connections
Has Statement Form
In Branch
Source Five color theorem (Wikipedia)
Proved By
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
Proved By: Percy John Heawood, Lead sentence, attribution
first proved by Percy John Heawood in 1890
In Group: Graph Theory, Lead section
The five color theorem is a result from graph theory that given a plane separated into regions, such
View the Source2. ProofWiki: Five Color Theorem - ProofWiki
ProofWikiProofQuote, Proof
The proof proceeds by the Principle of Mathematical Induction on the number of vertices.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.