Stating the Map Problem
Numberphile opens with the theorem's deceptive simplicity: every map can be colored with four colors so that no adjacent regions share one. MIT OpenCourseWare folds map coloring into a graph theory lecture, with Eric's earlier explanation serving as a familiar reference. The written record agrees on the statement, and the five color theorem shows why four is the sharp boundary, not a casual guess.






