Talk:Four color theorem

From Citizendium
Revision as of 00:12, 19 April 2010 by imported>Boris Tsirelson (Wow!)
Jump to navigation Jump to search
This article is developing and not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition:  (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. [d] [e]
Checklist and Archives
 Workgroup category:  Mathematics [Editors asked to check categories]
 Talk Archive:  none  English language variant:  American English

Created.--Thomas Wright Sulcer 04:06, 19 April 2010 (UTC)

Needs more wikilinks by persons who know which mathematical articles we've got and what they're called. Could use more pictures of diagrams?--Thomas Wright Sulcer 04:18, 19 April 2010 (UTC)

Wow! Looks impressing. (I have only a slight idea of this matter.) Boris Tsirelson 06:11, 19 April 2010 (UTC)
Retrieved from "https://citizendium.org/wiki/index.php?title=Talk:Four_color_theorem&oldid=783087"