We haven't determined the exact minimum number of colors needed to color any map so that no two touching regions share a color, in dimensions beyond a flat plane.
open
Global / Unspecified, Global
WS01244
The famous four-color theorem was resolved for flat maps, but generalizing the problem to more complex or higher-dimensional surfaces remains unsettled in several cases. This continues to be explored in graph theory and topology.