MathNet 2007-part-01 — 187 problems (EN–VI) Question 120

Prove that $n = 11$ is the least positive integer such that for any coloring of the edges of a complete graph of $n$ vertexes in three colors there exists a monochromatic cycle of length 4.