Is there any relation between the chromatic number of a graph $G$ and its complement $G'$ that are always true?
I saw these ones: $\chi(G)\chi(G')\geq n$ and $\chi(G)+\chi(G')\geq 2n$,
but I'm not pretty sure about them.
Is there any relation between the chromatic number of a graph $G$ and its complement $G'$ that are always true?
I saw these ones: $\chi(G)\chi(G')\geq n$ and $\chi(G)+\chi(G')\geq 2n$,
but I'm not pretty sure about them.