Eigenvalue bounds for independent sets
Combinatorics
2007-05-23 v1
Abstract
We derive bounds on the size of an independent set based on eigenvalues. This generalizes a result due to Delsarte and Hoffman. We use this to obtain new bounds on the independence number of the Erd\H{o}s-R\'{e}nyi graphs. We investigate further properties of our bounds, and show how our results on the Erd\H{o}s-R\'{e}nyi graphs can be extended to other polarity graphs.
Cite
@article{arxiv.math/0508081,
title = {Eigenvalue bounds for independent sets},
author = {C. D. Godsil and M. W. Newman},
journal= {arXiv preprint arXiv:math/0508081},
year = {2007}
}
Comments
18 pages