THE CARO - WEI - BOUND ON INDEPENDENCE
Jochen Harant, Yair Caro · 1981
1dG(v)+1 , where (G), V (G), and dG(v) are the independence number of G, the vertex set of G, and the degree of a vertex v in G, respectively. We discuss several improvements of this lower bound on independence. Algorithmic realizations are also considered.