Theorem
4.4.4
.
The chromatic number of a graph
\(G\)
is at least the clique number of
\(G\text{.}\)
in-context