9.1: Four Color Theorem
The Four-Color Theorem states that in any plane surface with regions in it (people think of them as maps ), the regions can be colored with no more than four colors in such a way that two regions that have a common border do not get the same color. They are called adjacent (next to each other) if they share a segment of the border, not just a point. [1]
This was one of the first theorems to be proved by a computer , using a proof by exhaustion . In proof by exhaustion, the conclusion is established by dividing it into cases and proving each one separately. The number of cases sometimes may be very large. For example, the first proof of the Four-Color Theorem was a proof by exhaustion with 1,936 cases (in 1976). This proof was controversial because most of the cases were checked by a computer program, not by traditional mathematical arguments. The shortest known proof of the Four-Color Theorem today still has over 600 cases.
Even though the problem was first presented in 1852 as a problem to color political maps of countries , mapmakers are not particularly interested in it. According to an article by the math historian Kenneth May , “Maps utilizing only four colors are rare, and those that do usually require only three. Books on cartography and the history of map-making do not mention the four-color property.”
Many simpler maps can be colored using three colors. The fourth color is required for some maps, such as one in which one region is surrounded by an odd number of others, which touch each other in a cycle. One such example is given in the image. The Five-Color Theorem states that five colors are enough to color a map. It has a short, elementary proof and was proved in the late 19th century ( Heawood 1890 ). Proving that four colors suffice turned out to be significantly more difficult. A number of false proofs and false counterexamples have appeared since the first statement of the Four-Color Theorem at University College London in England.
To be able to correctly state and solve the problem, it is necessary to clarify some aspects. First, all points that belong to three or more countries must be ignored.
For the purpose of the theorem every "country" has to be a connected region , or contiguous. In the real world, this is not true: Alaska as part of the United States , Nakhchivan as part of Azerbaijan , and Kaliningrad as part of Russia are not contiguous. Because the territory of a particular country must be the same color, four colors may not be sufficient. For instance, consider a simplified map, such as the one shown above: in this map, the two regions labeled A belong to the same country and must be the same color. This map then requires five colors since the two A regions together are contiguous with four other regions, each of which is contiguous with all the others. If A consisted of three regions, six or more colors might be required. In this manner, it is possible to construct maps that require an arbitrarily high number of colors. A similar construction also applies if a single color is used for all bodies of water, as is usual on real maps.
An easier-to-state version of the theorem uses graph theory . The set of regions of a map can be represented more abstractly as an undirected graph that has a vertex for each region and an edge for every pair of regions that share a boundary segment. [3] This graph is planar , meaning that these edges and vertices can be drawn on paper without any edges crossing each other. A planar graph can be formed from every map in this way. In graph-theoretic terminology, the Four-Color Theorem states that the vertices of every planar graph can be colored with at most four colors so that no two adjacent vertices receive the same color, or for short, "every planar graph is four-colorable" ( Thomas 1998 , p. 849; Wilson 2002 ).
Reference
- References (22)
Contributors and Attributions
-
Saburo Matsumoto
CC-BY-4.0