<P> Despite the motivation from coloring political maps of countries, the theorem is not of particular interest to cartographers . 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 mapmaking do not mention the four - color property" (Wilson 2014, 2). The theorem also does not guarantee the usual cartographic requirement that non-contiguous regions of the same country (such as Britain and Northern Ireland) be colored identically . </P> <P> 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 . The five color theorem, which has a short elementary proof, states that five colors suffice to color a map and was proved in the late 19th century (Heawood 1890); however, proving that four colors suffice turned out to be enormously harder . A number of false proofs and false counterexamples have appeared since the first statement of the four color theorem in 1852 . </P> <P> The four color theorem was proved in 1976 by Kenneth Appel and Wolfgang Haken . It was the first major theorem to be proved using a computer . Appel and Haken's approach started by showing that there is a particular set of 1,936 maps, each of which cannot be part of a smallest - sized counterexample to the four color theorem . (If they did appear, there would be a smaller counterexample .) Appel and Haken used a special - purpose computer program to confirm that each of these maps had this property . Additionally, any map that could potentially be a counterexample must have a portion that looks like one of these 1,936 maps . Showing this required hundreds of pages of hand analysis . Appel and Haken concluded that no smallest counterexamples exist because any must contain, yet do not contain, one of these 1,936 maps . This contradiction means there are no counterexamples at all and that the theorem is therefore true . Initially, their proof was not accepted by all mathematicians because the computer - assisted proof was infeasible for a human to check by hand (Swart 1980). Since then the proof has gained wider acceptance, although doubts remain (Wilson 2014, 216--222). Stephen Wolfram, for example, stated that in general, proofs can be arbitrarily long, and can be quite devoid of what might be considered meaningful structure and thus are often considered controversial - listing the Four - Color Theorem as just one example of such case . </P> <P> To dispel remaining doubt about the Appel--Haken proof, a simpler proof using the same ideas and still relying on computers was published in 1997 by Robertson, Sanders, Seymour, and Thomas . Additionally, in 2005, the theorem was proved by Georges Gonthier with general - purpose theorem - proving software . </P>

When was the four color map problem solved