Finding blowups one vertex at a time

Jacob Fox, Yuval Wigderson, Yunkun Zhou

An influential theorem of Nikiforov states that if an $N$-vertex graph $G$ contains at least ${\hat{I}}^3{N}^h$ copies of some fixed $h$-vertex graph $H$, then $G$ contains an $H$-blowup of o…