Five color theorem
id:
five-color-theorem-164-13003031
title:
Five color theorem
text:
The five color theorem is a result from graph theory that given a plane separated into regions, such as a political map of the countries of the world, the regions may be colored using no more than five colors in such a way that no two adjacent regions receive the same color. The five color theorem is implied by the stronger four color theorem, but is considerably easier to prove. It was based on a failed attempt at the four color proof by Alfred Kempe in 1879. Percy John Heawood found an error 1
brand slug:
wiki
category slug:
encyclopedia
description:
Planar maps require at most five colors
original url:
https://en.wikipedia.org/wiki/Five_color_theorem
date created:
2005-06-03T12:36:07Z
date modified:
2024-08-29T00:57:15Z
main entity:
{"identifier":"Q105222412","url":"https://www.wikidata.org/entity/Q105222412"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/a/a6/4CT_Non-Counterexample_1.svg","width":201,"height":200}
fields total:
13
integrity:
16