2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/142676We show that if a graph G of order n contains many copies of a given subgraph H, then it contains a blow-up of H of order log n.Combinatorics05C35text