The Four Color Theorem does not claim that 4 colors suffice to color a planar
map. Instead, 4 colors are sufficient to color any planar graph so that no two
vertices connected by an edge are colored with the same color. For any \(n\),
there is a map that requires at least \(n\) colors.
A collection of instances in which I believed something that wasn’t true. A reminder to read not to believe, but to weigh and consider .