Spectral bounds for the independence number of graphs and even uniform hypergraphs
Combinatorics
2026-03-10 v1
Abstract
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\'{a}sz number of a graph. The Hoffman bound on the Lov\'{a}sz number is also extended from regular graphs to general graphs.
Cite
@article{arxiv.2603.07501,
title = {Spectral bounds for the independence number of graphs and even uniform hypergraphs},
author = {Xinyu Hu and Jiang Zhou and Changjiang Bu},
journal= {arXiv preprint arXiv:2603.07501},
year = {2026}
}