another chromatic problem from 239
Source: 239 2015 J5
May 15, 2020
graph theorycombinatoricsedge coloring
Problem Statement
Edges of a complete graph with vertices are properly colored with colors. It turned out that for any two colors all the edges colored in one of these two colors can be described as union of several -cycles. Prove that is a power of .