Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡}

DOI10.1090/proc/15042zbMath1440.05129arXiv1910.11048OpenAlexW3006674765MaRDI QIDQ5111494

István Tomon, Benjamin Sudakov

Publication date: 27 May 2020

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

extremal number of a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (4)

Bipartite Turán problems for ordered graphs ⋮ The bipartite Turán number and spectral extremum for linear forests ⋮ Spectral Turán problems for intersecting even cycles ⋮ On color isomorphic subdivisions

Cites Work

• Unnamed Item
• Short proofs of some extremal results. II.
• Problems and results in combinatorial analysis and graph theory
• On a Turán type problem of Erdős
• Norm-graphs: Variations and applications
• Improved bounds for the extremal number of subdivisions
• Hypergraph based Berge hypergraphs
• On extremal problems of graphs and generalized graphs
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Norm-graphs and bipartite Turán numbers
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• On the Extremal Number of Subdivisions
• The counting lemma for regular k‐uniform hypergraphs
• On a problem of K. Zarankiewicz
• On the structure of linear graphs

This page was built for publication: Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡}