Induced Turán problem in bipartite graphs

Maria Axenovich, Jakob Zimmermann

The classical extremal function for a graph $H$, $ex(K_n,H)$ is the largest number of edges in a subgraph of $K_n$ that contains no subgraph isomorphic to $H$. Note that defining…