Every $t$-coloring of $K_{2t+1}$ contains a monochromatic cycle

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. :)

Thanks!

-
By circle do you mean cycle? One of the colors appears three times, so you have a monochromatic triangle even. – Louis Dec 31 '11 at 19:04
Daniel: I replaced the word "circle" by "cycle" everywhere since that seemed to be the intended term. Hope it's ok, – Srivatsan Dec 31 '11 at 19:22
yea it was, thanks! – Daniel Dec 31 '11 at 19:26

The number of edges in $K_{2t+1}$ is $\frac{2t(2t+1)}{2} = t(2t+1)$, so the average number of edges in a color class is $2t+1$. Hence there exists a monochromatic subgraph with at least $2t+1$ edges; this subgraph necessarily contains a cycle. Done!