What is the Three Color Problem?
This issue is a part of graph theory. It is well known that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color. But under what conditions would only three colors be required? That is a surprisingly knotty problem.