Coloring a map

Each region below must be fully colored in such that no two adjacent regions share the same color. What is the smallest number of colors necessary to perform the coloring?

Clarification : The outside does not need to be colored.


The answer is 4.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Dan Wilhelm
Jul 13, 2016

Suppose the figure can be colored using three distinct colors from the set { A , B , C } \{A, B, C\} .

We arbitrarily choose A A for the center circle. Since each of the four regions of the second circle touches A A , we must alternately color them with the two remaining colors, B B and C C .

Now, the right outer region is connected to B B and C C , so it must be colored the remaining color A A . Similarly, the top outer region is connected to C C and B B , so it must also be colored A A . However, the top and right regions are connected, so both cannot be colored A A . This is a contradiction; hence, the figure requires more than three colors.

We now know three colors is not possible. So, use some fourth color D D and color the outer circle alternately D D , A A , D D , A A . Since this results in a valid four-color arrangement, it can be colored using four distinct colors .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...