Asymptotic Improvements to the Lower Bound of Certain Bipartite Turán Numbers

DOI10.1017/S0963548311000423zbMath1242.05128OpenAlexW2130373483MaRDI QIDQ2888865

Simeon Ball, Valentina Pepe

Publication date: 4 June 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548311000423

zbMATH Keywords

complete bipartite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (4)

Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions ⋮ A note on projective norm graphs ⋮ Forbidden subgraphs in the norm graph ⋮ The Turán number of directed paths and oriented cycles

Cites Work

• On the algebraic variety \(\mathcal V_{r,t}\)
• The early evolution of the \(H\)-free process
• Norm-graphs: Variations and applications
• New asymptotics for bipartite Turán numbers
• An Upper Bound on Zarankiewicz' Problem
• On Graphs that do not Contain a Thomsen Graph
• On the structure of linear graphs

This page was built for publication: Asymptotic Improvements to the Lower Bound of Certain Bipartite Turán Numbers