Every side and diagonal of a regular $12$-gon is colored in one of $12$ given colors. Can this be done in such a way that, for every three colors, there exist three vertices which are connected to each other by segments of these three colors?
Source:
Tags: combinatorics, Coloring, combinatorial geometry
Every side and diagonal of a regular $12$-gon is colored in one of $12$ given colors. Can this be done in such a way that, for every three colors, there exist three vertices which are connected to each other by segments of these three colors?