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

For the independence number α(G) of a connected graph G on n vertices with m edges the inequality α(G)⩾12[(2m+n+1)−(2m+n+1)2−4n2] is proved and its algorithmic realization is discussed.