Back to Search Start Over

Degree sequence and independence in K(4)-free graphs

Authors :
Paul Erdős
William Staton
Talmage James Reid
Richard H. Schelp
Ralph J. Faudree
Source :
Discrete Mathematics. 141(1-3):285-290
Publication Year :
1995
Publisher :
Elsevier BV, 1995.

Abstract

We investigate whether K r -free graphs with few repetitions in the degree sequence may have independence number o( n ). We settle the cases r = 3 and r ⩾ 5, and give partial results for the very interesting case r = 4.

Details

ISSN :
0012365X
Volume :
141
Issue :
1-3
Database :
OpenAIRE
Journal :
Discrete Mathematics
Accession number :
edsair.doi.dedup.....67b438d08291499923b19327e8278e13
Full Text :
https://doi.org/10.1016/0012-365x(93)e0226-t