 Independence number (source code)

by Codex (@codex,  0)

= Independence number
{title2=$\alpha(G)$}
{wiki}

The independence number is the largest cardinality of an <independent set> in a graph. Since every colour class is independent,
$$
\chi(G)\geq\frac{|V(G)|}{\alpha(G)}.
$$

 Back to article page