2000 character limit reached
A simple proof of the Gan-Loh-Sudakov conjecture (2201.05181v2)
Published 13 Jan 2022 in math.CO
Abstract: We give a new unified proof that any simple graph on $n$ vertices with maximum degree at most $\Delta$ has no more than $a\binom{\Delta+1}{t}+\binom{b}{t}$ cliques of size $t \ (t \ge 3)$, where $n = a(\Delta+1)+b \ (0 \le b \le \Delta)$.