HMMT 2009 T5

The size of a finite graph is the number of vertices in the graph. (a) [15] Show that, for any $n>2$, and any positive integer $N$, there are finite graphs with size at least $N$ and with chromatic number $n$ such that removing any vertex (and all its incident edges) from the graph decreases its chromatic number.