Bounds on the independence number of a graph in terms of order, size and maximum degree

The independence number of a graph G is the maximum cardinality of an independent set of vertices in G. In this paper we obtain several new lower bounds for the independence number of a graph in terms of its order, size and maximum degree, and characterize graphs achieving equalities for these bounds. Our bounds improve previous bounds for graphs with large maximum degree.