A simple proof of the Gan-Loh-Sudakov conjecture

被引:1
作者
Chao, Ting-Wei [1 ]
Dong, Zichao [1 ]
机构
[1] Carnegie Mellon Univ, Mellon Coll Sci, Math Sci, Pittsburgh, PA 15213 USA
关键词
D O I
10.37236/10972
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We give a new unified proof that any simple graph on n vertices with maximum degree at most delta has no more than a(delta+1/t) + (b/t ) cliques of size t (t >= 3), where t t n = a(delta + 1) + b (0 <= b <= delta).
引用
收藏
页码:1 / 4
页数:4
相关论文
共 3 条
[1]  
Chase Zachary, 2020, ADV COMB
[2]   A NEW SHORT PROOF FOR THE KRUSKAL-KATONA THEOREM [J].
FRANKL, P .
DISCRETE MATHEMATICS, 1984, 48 (2-3) :327-329
[3]   Maximizing the Number of Independent Sets of a Fixed Size [J].
Gan, Wenying ;
Loh, Po-Shen ;
Sudakov, Benny .
COMBINATORICS PROBABILITY & COMPUTING, 2015, 24 (03) :521-527