Improved bounds for the extremal number of subdivisions

zbMath1416.05152arXiv1809.00468MaRDI QIDQ2001982

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

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)

Related Items (19)

Many Turán exponents via subdivisions ⋮ On the Extremal Number of Subdivisions ⋮ The Turán number of blow-ups of trees ⋮ Bipartite Turán problems for ordered graphs ⋮ Lower bounds on the Erdős–Gyárfás problem via color energy graphs ⋮ Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡} ⋮ A note on pseudorandom Ramsey graphs ⋮ The asymptotics of \(r(4,t)\) ⋮ Color Isomorphic Even Cycles and a Related Ramsey Problem ⋮ More on the extremal number of subdivisions ⋮ Repeated Patterns in Proper Colorings ⋮ On the rational Turán exponents conjecture ⋮ Local Properties via Color Energy Graphs and Forbidden Configurations ⋮ The Extremal Number of the Subdivisions of the Complete Bipartite Graph ⋮ Turán Numbers of Bipartite Subdivisions ⋮ The extremal number of longer subdivisions ⋮ Polynomial bound for partition rank in terms of analytic rank ⋮ Maximum bipartite subgraphs in $H$-free graphs ⋮ On color isomorphic subdivisions

Cites Work

• On a Turán type problem of Erdős
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• On the Extremal Number of Subdivisions
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On a problem of K. Zarankiewicz
• On the structure of linear graphs

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