More on the extremal number of subdivisions

David Conlon, Oliver Janzer, Joonkyung Lee

Given a graph $H$, the extremal number $\mathrm{ex}(n,H)$ is the largest number of edges in an $H$-free graph on $n$ vertices. We make progress on a number of conjectures about the…