New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth

In this paper we give new lower bounds on the independence number of a graph in terms of order, maximum degree and girth. We will see that our lower bounds improve (totally or partially) the existing bounds of Shearer, Staton, Hopkins and Staton, Lauer and Wormald.