Reveals spectral upper bounds for independence numbers in graphs and hypergraphs, suggesting broader applications in graph theory.
In this paper, we give spectral upper bounds for the independence number of even uniform hypergraphs and graphs, extend the Hoffman bound to even uniform hypergraphs, and give a simple spectral condition for determining the independence number, the Shannon capacity and the Lovász number of a graph. The Hoffman bound on the Lovász number is also extended from regular graphs to general graphs.
No takes yet. Share an insight, caveat, or question.
Hu et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: