The Extremal Number of the Subdivisions of the Complete Bipartite Graph

Abstract

For a graph $F$, the $k$-subdivision of $F$, denoted $F^k$, is the graph obtained by replacing the edges of $F$ with internally vertex-disjoint paths of length $k$. In this paper, we prove that $\mathrm{ex}(n,K_{s,t}^k)=O(n^{1+\frac{s-1}{sk}})$, which is tight for $t$ sufficiently large. This settles a conjecture of Conlon--Janzer--Lee, and improves on a substantial body of work by Conlon--Janzer--Lee and Jiang--Qiu.