Theorem for # of colors for a map?

duragezic

Lifer
Oct 11, 1999
11,234
4
81
Supposedly there is a theorem that determines the fewest number of colors needed to color ANY map if the rule is that no two countries with a common border have the same color.

I didn't think there was such a thing, but I guess there is. Does anyone just know the name of it? THanks.
 

JayHu

Senior member
Mar 19, 2001
412
0
0
"Four colour theorem"
or
Every planar graph is 4-colourable.

proven by mathematical induction, and using computer verification.