Density of small diameter subgraphs in $K_r$-free graphs

Eng Keat Hng, Domenico Mergoni Cecchelli

We denote by $\text{ex}(n,H,F)$ the maximum number of copies of $H$ in an $n$-vertex graph that does not contain $F$ as a subgraph. Recently, Grzesik, Győri, Salia, Tompkins cons…