Highly Influenced

8 Excerpts

- Published 1991 in Journal of Graph Theory

A vertex set Y in a (hyperbraph is called k-independent if in the sub(hyper)graph induced by Y every vertex is incident to less than k edges. We prove a lower bound for the maximum cardinality of a k-independent set-in terms of degree sequences-which strengthens and generalizes several previously known results, including Turin's theorem.

@article{Caro1991ImprovedLB,
title={Improved lower bounds on k-independence},
author={Yair Caro and Zsolt Tuza},
journal={Journal of Graph Theory},
year={1991},
volume={15},
pages={99-107}
}