Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: Question about a 4-coloring related theorem
Replies: 2   Last Post: Jul 2, 2011 6:33 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Gang

Posts: 3
Registered: 7/1/11
Question about a 4-coloring related theorem
Posted: Jul 1, 2011 5:05 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Hi all,

Could Anyone here help me recall the name of a graph theorem? Basically it states like following:

In a 2D planar map, at most 4 regions/countries can be bordered with each other. Namely, you cannot find such 5 regions/countries, among which any one is bordered with all other 4 regions/countries.

Thanks many tons in advance!

-Gang



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.