Let G be a graph on n vertices and G' be the complement of G. Give an argument supporting why the chromatic number of G times the chromatic number of G' is greater than or equal to n.
Сhromatic number of a graph G is the smallest number of colors needed to color vertices of G so that every two vertices connected by an edge in G have different colors (we name such colorings as valid colorings).
Let .
Let are valid colorings of G and G’.
Then is a valid coloring of the full graph .
Indeed, let and be two vertices of G.
Then they are connected by the edge either in G or in G’.
If then as .
If then as .
As we have a valid coloring of the full graph , the number of used colors must be greater or equal than . But , as all n vertices of this graph are connected. On the other hand, we used not greater than colors for a valid coloring of this graph.
Therefore, , as required.
Comments