The extremal number of the subdivisions of the complete bipartite graph

DOI10.1137/19M1269798MaRDI QIDQ5210907zbMATH OpenWikidataFDO

Authors Oliver Janzer

Publication date 16 January 2020

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.04084

zbMATH Keywords

complete bipartite graphextremal numbersubdivisionTurán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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 $mathrmex(n,K_{s,t}^k)=O(n^{1+fracs-1sk})$, 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.

Recommendations

• The extremal number of longer subdivisions
• Improved bounds for the extremal number of subdivisions
• More on the extremal number of subdivisions
• Turán numbers of bipartite subdivisions
• On the extremal number of subdivisions

Cites work

• Compact topological minors in graphs
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• scientific article; zbMATH DE number 3333193 (Why is no real title available?)
• Improved bounds for the extremal number of subdivisions
• On the extremal number of subdivisions
• On the rational Turán exponents conjecture
• On the structure of linear graphs
• Rational exponents in extremal graph theory
• Small topological complete subgraphs of ``dense graphs
• Turán numbers of bipartite subdivisions
• Turán numbers of subdivided graphs

Cited in

(26)

• Subdivision thresholds for two classes of graphs
• The size of the largest bipartite subgraphs
• On the rational Turán exponents conjecture
• Improved bounds for the extremal number of subdivisions
• On color isomorphic subdivisions
• More on the extremal number of subdivisions
• Splits with forbidden subgraphs
• scientific article; zbMATH DE number 4160792 (Why is no real title available?)
• scientific article; zbMATH DE number 7029068 (Why is no real title available?)
• scientific article; zbMATH DE number 2170440 (Why is no real title available?)
• Turán numbers of subdivided graphs
• The extremal number of longer subdivisions
• On the extremal number of subdivisions
• Some remarks on the Zarankiewicz problem
• Turán numbers of bipartite subdivisions
• Local conditions for exponentially many subdivisions
• Combinatorial Geometry and Graph Theory
• Many Turán exponents via subdivisions
• On Turán exponents of bipartite graphs
• Lower bounds on the Erdős–Gyárfás problem via color energy graphs
• Random polynomial graphs for random Turán problems
• Topological minors in bipartite graphs
• A new approach for the Brown-Erdős-Sós problem (extended abstract)
• Acyclic colorings of graphs with obstructions
• Saturation of K₄ subdivisions in multidimensional grids
• The splitting number of complete bipartite graphs

This page was built for publication: The extremal number of the subdivisions of the complete bipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210907)