Answers are grounded in this paper and cite their sources.
Given a graph H, the Turán number ex(n,H) is the largest number of edges in an H-free graph on n vertices. We make progress on a recent conjecture of Conlon, Janzer, and Lee [ More on the Extremal Number of Subdivisions, arXiv:1903.10631v1, 2019] on the Turán numbers of bipartite graphs, which in turn yields further progress on a conjecture of Erdös and Simonovits [ Combinatorica, 1 (1981), pp. 25--42]. Let s,t,k≥ 2 be integers. Let Ks,tᵏ denote the graph obtained from the complete bipartite graph Ks,t by replacing each edge $uv$ in it with a path of length k between u and v such that the $st$ replacing paths are internally disjoint. It follows from a general theorem of Bukh and Conlon [J. Eur. Math. Soc. (JEMS), 20 (2018), pp. 1747--1757] that ex(n,Ks,tᵏ)=Ω(n1+1/k-1/sk). Conlon, Janzer, and Lee recently conjectured that for any integers s,t,k≥ 2, ex(n,Ks,tᵏ)=O(n1+1/k-1/sk). Among many other things, they settled the $k=2$ case of their conjecture. As the main result of this paper, we prove their conjecture for $k=3,4$. Our main results also yield infinitely many new so-called Turán exponents: rationals r∈ (1,2) for which there exists a bipartite graph H with ex(n, H)=Θ(nʳ), adding to the lists recently obtained by Jiang, Ma, and Yepremyan [ On Turán Exponents of Bipartite Graphs, arXiv:1806.02838, 2018], by Kang, Kim, and Liu [ On the Rational Turán Exponent Conjecture, arXiv:1811.06916, 2018], and by Conlon, Janzer, and Lee. Our method builds on an extension of the Conlon--Janzer--Lee method. We also note that the extended method also gives a weaker version of the Conlon--Janzer--Lee conjecture for all k≥ 2.
No takes yet. Share an insight, caveat, or question.
Jiang et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: