0
$\begingroup$

I am new in this field and I was trying to understand about clique and chromatic number. Please help me to show this relation. Well I know that: relation can be written like this: $$\chi(G)\geq\omega(G)$$ where $\chi(G)$ is the Chromatic number and $\omega(G)$ is the Clique number.

$\endgroup$
  • $\begingroup$ Don't worry too much about the symbols; your question isn't too symbol-heavy anyways (you could even have compromised and written "x(G) >= w(G)" for better readability). For next time, you can use MathJax to write symbols and equations. $\endgroup$ – Arthur Mar 18 '16 at 8:18
1
$\begingroup$

In a colouring of the graph, every clique must consist of differently coloured vertices. This especially holds for the largest clique.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.