## A lower bound on the independence number of a graph

- Jochen Harant
- Discrete Mathematics
- 1998

@inproceedings{HarantOnTI, title={On the Independence Number of a Graph in Terms of N and M}, author={Jochen Harant and Ingo Schiermeyer} }

For the independence number (G) of a connected graph G on n vertices with m edges the inequality (G) 1 2 (2m + n + 1) ? p (2m + n + 1) 2 ? 4n 2 ] is proved and its algorithmic realization is discussed.