Question 147
A $k$-clique of a graph is a set of $k$ vertices such that all pairs of vertices in the clique are adjacent. The clique number of a graph is the size of the largest clique in the graph. Does there exist a graph which has a clique number smaller than its chromatic number?