Spectral bounds for the independence number of graphs and even uniform hypergraphs
Journal of Combinatorial Theory, Series A · 2026-10 · 223 · 106201
DOI: 10.1016/j.jcta.2026.106201 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Theory, Series A, 2026-10. Verfasst von Xinyu Hu und 2 weiteren Autor:innen. Die Arbeit nennt 27 Literaturangaben. Gefördert von: Fundamental Research Funds for the Central Universities, National Natural Science Foundation of China.
Abstract (Originalsprache)
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.
Förderung
- Fundamental Research Funds for the Central Universities
- National Natural Science Foundation of China
Zitieren
APA
Hu, X., Zhou, J., & Bu, C. (2026). Spectral bounds for the independence number of graphs and even uniform hypergraphs. Journal of Combinatorial Theory, Series A, 223, 106201. https://doi.org/10.1016/j.jcta.2026.106201
Vancouver
Hu X, Zhou J, Bu C. Spectral bounds for the independence number of graphs and even uniform hypergraphs. Journal of Combinatorial Theory, Series A. 2026;223:106201. doi:10.1016/j.jcta.2026.106201
BibTeX
@article{Hu2026,
author = {Hu, Xinyu and Zhou, Jiang and Bu, Changjiang},
title = {Spectral bounds for the independence number of graphs and even uniform hypergraphs},
journal = {Journal of Combinatorial Theory, Series A},
year = {2026},
volume = {223},
pages = {106201},
doi = {10.1016/j.jcta.2026.106201}
}
EUVIMED