Coloring the Great Rhombicosidodecahedron

This is the Great Rhombicosidodecahedron:

What is the minimum number of colors you need to color all sides of a Great Rhombicosidodecahedron such that no two sides that join on an edge have the same color?


Image credit: http://m100.nthu.edu.tw/
2 3 4 5 6 7 8 None of these answers

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Geoff Pilling
Nov 27, 2016

You need at least three colors since three faces meet at a vertex, and all three of those would need to be a different color.

However, the cool thing here is that you can do it with only 3 \boxed3 colors, by coloring the squares one color, the hexagons another color, and the decagons a third color, like this:


Image credit: commons.wikimedia.org

How about some generalisations to other 3d/4d objects?? Is there any formula/theory regarding the same??

Kunal Gupta - 4 years, 6 months ago

Are there any polyhedra where the ideal coloring isn't as symmetric?

E.g. for a 2n+1 polygon, we need 3 colors on the edges.

Calvin Lin Staff - 4 years, 6 months ago

Log in to reply

The icosahedron , although as symmetric as it gets, has a surprisingly non-symmetric ideal coloring scheme, and it beats the "n+1" rule where n is the number of adjacent sides. I believe the dodecahedron fits into that category as well. i.e. It is symmetric and it beats the "n+1 rule".

Lemme see if I can think of any others...

Geoff Pilling - 4 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...