The Turán number of blow-ups of trees

Andrzej Grzesik, Oliver Janzer, Zoltán Lóránt Nagy

A conjecture of Erdős from 1967 asserts that any graph on $n$ vertices which does not contain a fixed $r$-degenerate bipartite graph $F$ has at most $C{n}^{2-1/r}$ edges, where $C$ i…