A Tight Lower bound on Trees in Graphs

Chase Wilson

Mubayi and Verstraete conjectured that if $T$ is a tree on $t+1$ vertices, then any $n$-vertex graph $G$ with average degree $d$ contains at least \[ n d(d - 1) \cdots (d - t + 1…