 Clique counting from iterated shadows

For the uniform set family of vertex sets of $r$-cliques, its $(r-2)$-fold lower shadow consists of graph edges. Repeated use of the Kruskal-Katona theorem bounds clique count from edge count. Sixteen four-cliques have at least twenty-three triples in their shadow and at least eighteen edges in their second shadow, by the expansions $16=\left(\genfrac{}{}{0ex}{}{6}{4}\right)+\left(\genfrac{}{}{0ex}{}{3}{3}\right)$ and $23=\left(\genfrac{}{}{0ex}{}{6}{3}\right)+\left(\genfrac{}{}{0ex}{}{3}{2}\right)$. Hence a graph with fifteen edges has at most fifteen four-cliques, attained by the complete graph on six vertices.