Problem

Source: Lituania 2001

Tags: combinatorics proposed, combinatorics



I like this one : Let $n$ be an integer. Prove that there exists a finite graph with no triangle and with chromatic number greater than $n$. Pierre.