Some remarks on the Zarankiewicz problem

DOI10.1017/S0305004121000475zbMath1491.05109arXiv2007.12816OpenAlexW3170685040MaRDI QIDQ5081317

David Conlon

Publication date: 14 June 2022

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

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

zbMATH Keywords

random algebraic methodmaximum number of edges in a bipartite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (1)

Exact values for some unbalanced Zarankiewicz numbers

Cites Work

• Unnamed Item
• Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
• The de Bruijn-Erdős theorem for hypergraphs
• On the combinatorial problems which I would most like to see solved
• Norm-graphs: Variations and applications
• Rational exponents in extremal graph theory
• On the rational Turán exponents conjecture
• More on the extremal number of subdivisions
• Norm-graphs and bipartite Turán numbers
• Random algebraic construction of extremal graphs
• On discrepancy bounds via dual shatter function
• Graphs with few paths of prescribed length between any two vertices
• The Extremal Number of the Subdivisions of the Complete Bipartite Graph
• Shatter Functions with Polynomial Growth Rates
• On Graphs that do not Contain a Thomsen Graph
• On a problem of K. Zarankiewicz

This page was built for publication: Some remarks on the Zarankiewicz problem