The Extremal Number of the Subdivisions of the Complete Bipartite Graph
From MaRDI portal
Publication:5210907
DOI10.1137/19M1269798zbMath1430.05060arXiv1906.04084WikidataQ126356144 ScholiaQ126356144MaRDI QIDQ5210907
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
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Many Turán exponents via subdivisions ⋮ On Turán exponents of bipartite graphs ⋮ Some remarks on the Zarankiewicz problem ⋮ Splits with forbidden subgraphs ⋮ Lower bounds on the Erdős–Gyárfás problem via color energy graphs ⋮ Random polynomial graphs for random Turán problems ⋮ On the rational Turán exponents conjecture ⋮ Turán Numbers of Bipartite Subdivisions
Cites Work
- Unnamed Item
- Unnamed Item
- Small topological complete subgraphs of ``dense graphs
- Rational exponents in extremal graph theory
- On the rational Turán exponents conjecture
- Improved bounds for the extremal number of subdivisions
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Compact topological minors in graphs
- Turán Numbers of Subdivided Graphs
- On the Extremal Number of Subdivisions
- Turán Numbers of Bipartite Subdivisions
- On the structure of linear graphs
This page was built for publication: The Extremal Number of the Subdivisions of the Complete Bipartite Graph