Greedy independent-set bound
ID: greedy-independent-set-bound
Every finite graph of maximum degree at most has an independent set of size at least . Greedily choose a vertex and delete its closed neighbourhood.
New to topics? Read the docs here!