Let $G$ be a graph on $n$ vertices. We call an induced subgraph $H$ of $G$ a clique, if it is isomorphic to $K_l$ for

some value of $l$ and we call an it an independent set if it is isomorphic to an empty graph. We denote the sizes

of the largest clique and independent set of $G$ by $(G)$ and $(G)$ respectively. With this, show the

following:

$(G)(G)$

$(G)\frac{n}{(G)}$