Greedy independent-set bound
= Greedy independent-set bound
Every finite graph of maximum degree at most $\Delta$ has an <independent set> of size at least $|V|/(\Delta+1)$. Greedily choose a vertex and delete its closed neighbourhood.
= Greedy independent-set bound
Every finite graph of maximum degree at most $\Delta$ has an <independent set> of size at least $|V|/(\Delta+1)$. Greedily choose a vertex and delete its closed neighbourhood.