I need help in the following question:
I need to prove that in all possible coloring with $t$ colors of the complete graph $K$ with $2t+1$ vertices, there will always be a monochromatic cycle (its size doesn't matter).
I tried with induction on number of colors ($t$) but got nowhere.
Any help would be welcome. :)