Complete graph in 3 colors
Source: Saint Petersburg math olympiad 2024, 10.7
September 22, 2024
combinatorics
Problem Statement
The edges of a complete graph on vertices are colored in three colors. Prove that this graph contains a non-self-intersecting single-color cycle whose length is odd and not less than .