首页   按字顺浏览 期刊浏览 卷期浏览 Improved lower bounds onk‐independence
Improved lower bounds onk‐independence

 

作者: Yair Caro,   Zsolt Tuza,  

 

期刊: Journal of Graph Theory  （WILEY Available online 1991）
卷期: Volume 15, issue 1  

页码: 99-107

 

ISSN:0364-9024

 

年代: 1991

 

DOI:10.1002/jgt.3190150110

 

出版商: Wiley Subscription Services, Inc., A Wiley Company

 

数据来源: WILEY

 

摘要:

AbstractA vertex setYin a (hyper)graph is calledk‐independent if in the sub(hyper)‐graph induced byYevery vertex is incident to less thankedges. We prove a lower bound for the maximum cardinality of ak‐independent set—in terms of degree sequences—which strengthens and generalizes several previously known results, including Turán

 

点击下载:  PDF (418KB)



返 回