A local clique density theorem in $H$-free graphs
In 2016, Reiher's clique density theorem determined the minimum number of copies of $K_t$ in a graph with a prescribed edge density. In this paper, we investigate its local version and prove a local clique density theorem in $H$-free graphs as follows. For integers $r$ and $t$ with $2\leq t\leq r-1$, any $r$-chromatic...