08
Nov
09

Four Color Theorem


How many different colors are sufficient to color the countries on a map in such a way that no two adjacent countries have the same color?

After examining a wide variety of different planar graphs, one discovers the apparent fact that every graph, regardless of size or complexity, can be coloured with just four distinct colors. This “four-color conjecture” was first noted by August Ferdinand Mobius in 1840.

Three colors are adequate for simpler maps, but an additional fourth color is required for some maps, such as a map in which one region is surrounded by an odd number of other regions that touch each other in a cycle.

Read mathpages for more.

Advertisements

0 Responses to “Four Color Theorem”



  1. Leave a Comment

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s


So what’s this blog about?

Another attempt? Well yes. Attempting to figure out another sustainable model (there are some other attempts going on parallel-ly). Well, we have a lot of questions in mind. we read up stuff, we do some research to find answers to these questions. This is an attempt to publish that little 15-20 minute research.
November 2009
M T W T F S S
« Oct   Dec »
 1
2345678
9101112131415
16171819202122
23242526272829
30  

Click to subscribe to One Post Daily.

Join 5 other followers