论文标题
gan-loh-sudakov猜想的简单证明
A simple proof of the Gan-Loh-Sudakov conjecture
论文作者
论文摘要
我们给出了一个新的统一证据，表明$ n $顶点的任何简单图形最高$δ$的任何简单图形不超过$ a \ binom {δ+1} {t} {t}+\ binom {b} {b} {t} $ cliques $ t \ t \ ge 3）$ n = a（$ n = a（te）
We give a new unified proof that any simple graph on $n$ vertices with maximum degree at most $Δ$ has no more than $a\binom{Δ+1}{t}+\binom{b}{t}$ cliques of size $t \ (t \ge 3)$, where $n = a(Δ+1)+b \ (0 \le b \le Δ)$.
