Spectral bounds for the independence number of graphs and even uniform hypergraphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911496244559872 |
|---|---|
| author | Hu, Xinyu Zhou, Jiang Bu, Changjiang |
| author_facet | Hu, Xinyu Zhou, Jiang Bu, Changjiang |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_07501 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Spectral bounds for the independence number of graphs and even uniform hypergraphs Hu, Xinyu Zhou, Jiang Bu, Changjiang Combinatorics 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. |
| title | Spectral bounds for the independence number of graphs and even uniform hypergraphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2603.07501 |