A relative bound for independence
Combinatorics
2023-11-17 v1
Abstract
We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.
Cite
@article{arxiv.1901.00585,
title = {A relative bound for independence},
author = {Bogdan Nica},
journal= {arXiv preprint arXiv:1901.00585},
year = {2023}
}
Comments
10 pages; preprint, comments are welcome