User:MarkMYoung/4-color map problem

4-Color Map Problem
I believe any map can be colored with at least $${2}^{k-1}$$ and at most $${2}^{n}$$ colors where n is the number of occuppied dimensions, k is the number of regions to be colored, and n, k &isin; {1,2,3,&hellip;}.