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.
机构:
Shanghai Univ, Dept Math, Shanghai 200444, Peoples R ChinaShanghai Univ, Dept Math, Shanghai 200444, Peoples R China
Kang, Liying
Wang, Dingguo
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China
Chongqing Normal Univ, Coll Math Sci, Chongqing 400047, Peoples R ChinaShanghai Univ, Dept Math, Shanghai 200444, Peoples R China
Wang, Dingguo
Shan, Erfang
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Univ, Sch Management, Shanghai 200444, Peoples R ChinaShanghai Univ, Dept Math, Shanghai 200444, Peoples R China