The extremal number of the subdivisions of the complete bipartite graph

preprint2019arXivOpen access

Abstract

For a graph FF, the kk-subdivision of FF, denoted FkF^k, is the graph obtained by replacing the edges of FF with internally vertex-disjoint paths of length kk. In this paper, we prove that ex(n,Ks,tk)=O(n1+s−1sk)\mathrm{ex}(n,K_{s,t}^k)=O(n^{1+\frac{s-1}{sk}}), which is tight for tt 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.