On the extremal number of incidence graphs

Jisun Baek, David Conlon, Joonkyung Lee

Given a graph $H$ and a natural number $n$, the extremal number $\mathrm{ex}(n,H)$ is the largest number of edges in an $n$-vertex graph containing no copy of $H$. In this paper,…