Question #171310

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.


1
Expert's answer
2021-03-16T08:33:12-0400

Сhromatic number χ(G)\chi(G) 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 χ(G)=k,χ(G)=m,Ik={1,2,,k},Im={1,2,,m}\chi(G)=k, \chi(G’)=m, I_k=\{1,2,\dots, k\}, I_m=\{1,2, \dots,m\} .

Let ϕ:V(G)Ik,ψ:V(G)Im\phi: V(G)\to I_k, \psi: V(G)\to I_m are valid colorings of G and G’.

Then (ϕ,ψ):V(G)Ik×Im(\phi,\psi): V(G)\to I_k\times I_m is a valid coloring of the full graph GGG\cup G’ .

Indeed, let v1v_1 and v2v_2 be two vertices of G.

Then they are connected by the edge (v1,v2)(v_1, v_2) either in G or in G’.

If (v1,v2)E(G)(v_1, v_2)\in E(G) then (ϕ(v1),ψ(v1))(ϕ(v2),ψ(v2))(\phi(v_1),\psi(v_1))\ne (\phi(v_2),\psi(v_2)) as ϕ(v1)ϕ(v2)\phi(v_1)\ne \phi(v_2).

If (v1,v2)E(G)(v_1, v_2)\in E(G’) then (ϕ(v1),ψ(v1))(ϕ(v2),ψ(v2))(\phi(v_1),\psi(v_1))\ne (\phi(v_2),\psi(v_2)) as ψ(v1)ψ(v2)\psi(v_1)\ne \psi(v_2) .

As we have a valid coloring of the full graph GGG\cup G’, the number of used colors must be greater or equal than χ(GG)χ(G\cup G’). But χ(GG)=n\chi(G\cup G’)=n , as all n vertices of this graph are connected. On the other hand, we used not greater than kmkm colors for a valid coloring of this graph.

Therefore, kmnkm\geq n , as required.


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS