DEGREE SEQUENCE AND INDEPENDENCE IN K(4)-FREE GRAPHS

被引:4
|
作者
ERDOS, P
FAUDREE, R
REID, TJ
SCHELP, R
STATON, W
机构
[1] HUNGARIAN ACAD SCI,INST MATH,H-1053 BUDAPEST,HUNGARY
[2] MEMPHIS STATE UNIV,DEPT MATH SCI,MEMPHIS,TN 38152
[3] UNIV MISSISSIPPI,DEPT MATH,UNIVERSITY,MS 38677
关键词
D O I
10.1016/0012-365X(93)E0226-T
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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 greater than or equal to 5, and give partial results for the very interesting case r = 4.
引用
收藏
页码:285 / 290
页数:6
相关论文
共 50 条