Talk:Four color theorem

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

Unused subpages
Unused subpages: - External Links - Works - Discography - Filmography - Catalogs - Timelines - Gallery - Audio - Video - Code - Tutorials - Student Level - Signed Articles - Function - Addendum - Debate Guide - Advanced - Recipes - Citable Version

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)

You could also add an external link from WP to here (as I did for "plane" for instance); it does not add google juice, but can add readers. Boris Tsirelson 06:21, 19 April 2010 (UTC)

Thanks Boris!!! I no longer have a Wikipedia account but feel free to add the link from WP. The two equations are from WP and some of the proof-logic from WP is here, rewritten, but other than that I'd say it's 90% new.--Thomas Wright Sulcer 11:24, 19 April 2010 (UTC)

Talk:Four color theorem

Navigation menu

Search