Four color theorem/Definition: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Thomas Wright Sulcer
(def)
 
imported>Peter Schmitt
No edit summary
 
Line 1: Line 1:
<noinclude>{{Subpages}}</noinclude>
<noinclude>{{Subpages}}</noinclude>
A [[problem]] in [[cartography]] and [[mathematics]] when it was noticed that it only required four [[color]]s to fill in the different [[contiguous]] [[shape]]s on any [[map]] of regions or [[country|countries]] or [[province]]s in a flat surface known as a [[plane (geometry)|plane]] such that no two [[adjacent]] regions with a common [[boundary]] had the same color; [[mathematician]]s proved this using [[computer]]s in 1976.
(A famous mathematical statement with a long history) For every [[planar graph]], four colors suffice to color its vertices in such a way that adjacent vertices have different colors.

Latest revision as of 07:56, 19 April 2010

This article is developing and not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
https://en.citizendium.org/wiki/index.php?title=Four_color_theorem/Definition&printable=yes
A definition or brief description of Four color theorem.

(A famous mathematical statement with a long history) For every planar graph, four colors suffice to color its vertices in such a way that adjacent vertices have different colors.

Retrieved from "https://citizendium.org/wiki/index.php?title=Four_color_theorem/Definition&oldid=737360"