Work

Spectral bounds for the independence number of graphs and even uniform hypergraphs

Year: 2026

Type: article

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ász number of a graph. The Hoffman bound on the Lovász number is also extended from regular graphs to general graphs.

Source: Journal of Combinatorial Theory Series A

DOI: 10.1016/j.jcta.2026.106201

Authors: Xinyu Hu, Jiang Zhou, Changjiang Bu

Institution: Harbin Engineering University

Language: English

Topic: Graph theory and applications

Subfield: Geometry and Topology

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $4,210

Funders: National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities