In a graph with $n$ vertices, let $\alpha(G)$ be the independence number and $\omega(G)$ be the clique number. Which inequality relates these to the chromatic number $\chi(G)$?