Improved bounds for the extremal number of subdivisions

MaRDI QIDQ2001982zbMATH OpenFDO

Authors Oliver Janzer

Publication date 11 July 2019

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.00468, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i3p3

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Füredi, Alon-Krivelevich-Sudakov theorem

Mathematics Subject Classification ID

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

Abstract: Let $H_t$ be the subdivision of $K_t$. Very recently, Conlon and Lee have proved that for any integer $tgeq3$, there exists a constant $C$ such that $extex(n,H_t)leqC{n}^{3/2-1/6^t}$. In this paper, we prove that there exists a constant $C^{\prime }$ such that $extex(n,H_t)leq{C}^{\prime }{n}^{3/2-frac14t-6}$.

Recommendations

• On the extremal number of subdivisions
• More on the extremal number of subdivisions
• The extremal number of longer subdivisions
• A new bound on the total domination subdivision number
• Improved bounds for rectangular and guillotine partitions
• scientific article; zbMATH DE number 6107236
• The extremal number of the subdivisions of the complete bipartite graph
• An improved upper bound for the sum-free subset constant
• An upper bound for the total domination subdivision number of a graph
• scientific article; zbMATH DE number 3894191

Cites work

• On a Turán type problem of Erdős
• On a problem of K. Zarankiewicz
• On the extremal number of subdivisions
• On the structure of linear graphs
• The history of degenerate (bipartite) extremal graph problems
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions

Cited in

(27)

• Local properties via color energy graphs and forbidden configurations
• Maximum bipartite subgraphs in $H$-free graphs
• Color isomorphic even cycles and a related Ramsey problem
• The extremal number of the subdivisions of the complete bipartite graph
• Polynomial bound for partition rank in terms of analytic rank
• On color isomorphic subdivisions
• Turán numbers of bipartite subdivisions
• Turán numbers of subdivided graphs
• On the rational Turán exponents conjecture
• More on the extremal number of subdivisions
• Repeated patterns in proper colorings
• The Turán number of blow-ups of trees
• Turán number of bipartite graphs with no \(K_{t,t}\)
• Bipartite Turán problems for ordered graphs
• Ramsey numbers and the Zarankiewicz problem
• Lower bounds on the Erdős–Gyárfás problem via color energy graphs
• Tight bounds for divisible subdivisions
• Extremal graphs for the odd prism
• The asymptotics of \(r(4,t)\)
• On the extremal number of subdivisions
• Growth rates of the bipartite Erdős-Gyárfás function
• Limit shape of subpartition-maximizing partitions
• Induced Turán problem in bipartite graphs
• The extremal number of longer subdivisions
• Combinatorial g-conjecture for interval subdivisions
• Many Turán exponents via subdivisions
• A note on pseudorandom Ramsey graphs

This page was built for publication: Improved bounds for the extremal number of subdivisions

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