1 problem

Let $G$ be a graph, with chromatic number $\chi$, clique number $\omega$, maximum degree $\Delta$, order $n$, and let $\overline{\kappa}=\kappa(\overline{G})$ denote the connectivi…