A lower bound on independence in terms of degrees

On the independence number of a graph in terms or order and size

Discrete Mathematics
Clique is hard to approximate within n1-

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Foreword: special issue on stability in graphs and related topics

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Note: Independence in connected graphs

Discrete Applied Mathematics

Hi-index	0.04

We prove a new lower bound on the independence number of a simple connected graph in terms of its degrees.