Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.


Gang
Posts:
3
Registered:
7/1/11


Question about a 4coloring related theorem
Posted:
Jul 1, 2011 5:05 PM


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



