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.
Ericsson, whose work is widely cited by 10,000-hours rule proponents like Gladwel’s Outliers, did not claim nor does he endorse the rule. See more discussion at 10,000 hours +/- 10,000 hours .