Spectral bounds for the independence number of graphs and even uniform hypergraphs
This paper establishes spectral upper bounds for the independence number of graphs and even uniform hypergraphs, extends the Hoffman bound to these structures, and provides a simple spectral condition to determine key graph parameters including the independence number, Shannon capacity, and Lovász number.