MathNet 2009-part-05 — 172 problems (EN–VI) Question 141

Prove that, for all $n \gt 3$, there exists a graph with chromatic number $n$ that does not contain any $n$-cliques.