Eigenvalue bounds for independent sets
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 Erdos-R\'enyi graphs. We investigate further properties of our bounds, and show how our results on the Erdos-R\'enyi graphs can be extended to other polarity graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.