  In this paper we disprove a conjecture of Lidick\'y and Murphy about the
number of copies of a given graph in a $K_r$-free graph and give an alternative
general conjecture. We also prove an asymptotically tight bound on the number
of copies of any bipartite graph of radius at most $2$ in a triangle-free
graph.
