There is a formula that holds for any (orientable) surface, which is pretty cool: floor((7 + sqrt(1 + 48*g))/2), where g is the topological genus of the surface.
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
i can with 1 color
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Ok, what does this mean?
-
The classic version of this is the 2D map coloring problem. You have a map of countries, and you need to color the map so no two adjacent countries have the same color. On a 2D map, no matter how complicated the map, you can do it with only four colors.
- 1 more reply
New conversation -
-
-
if you pay me enough i can do it with 6
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
For those who are confused as to what this means(and why it's so awesome) this should help: http://faculty.smcm.edu/sgoldstine/torus7.html … It explains the old topological saying that a donut is the same as a coffee mug!
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
That looks DELICIOUS
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
But it took an amazing 13 colors to properly paint Renfield Slocomb’s manse in Hillsborough Chase in 1859 due to the very high turrets and an expansive sitting room adjacent to the library. And they had to use TWO COATS!
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
How many colors for a general non-planar graph? (e.g. how many to color a Voronoi network of 3D cells?)
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.