Ramsey numbers and the Zarankiewicz problem

DOI10.1112/BLMS.13040MaRDI QIDQ6614901zbMATH OpenFDO

Authors David Conlon, Sam Mattheus, Dhruv Mubayi, J. Verstraëte

Publication date 8 October 2024

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/BLMS.13040

zbMATH Keywords

Ramsey numbersZarankiewicz numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• Bipartite Ramsey numbers and Zarankiewicz numbers
• Some remarks on the Zarankiewicz problem
• Lower bounds for some Ramsey numbers
• Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs
• The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\)

Cites work

• A note on odd cycle-complete graph Ramsey numbers
• A note on pseudorandom Ramsey graphs
• A note on Ramsey numbers
• A note on the independence number of triangle-free graphs
• Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
• Dynamic concentration of the triangle‐free process
• Extremal problems for cycles in graphs
• scientific article; zbMATH DE number 1219619 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• Improved bounds for the extremal number of subdivisions
• On cycle—Complete graph ramsey numbers
• On the number of graphs without 4-cycles
• Ramsey numbers for cycles in graphs
• The asymptotics of r(4,t)
• The early evolution of the \(H\)-free process
• The method of hypergraph containers
• The nonexistence of certain generalized polygons
• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The size of bipartite graphs with a given girth
• The triangle-free process and the Ramsey number \(R(3,k)\)

Cited in

(7)

• Ramsey numbers and a general Erdős-Rogers function
• On off-diagonal F-Ramsey numbers
• When are off-diagonal hypergraph Ramsey numbers polynomial?
• Clique supersaturation
• Induced subgraphs of K_r-free graphs and the Erdős-Rogers problem
• Coloring graphs from random lists
• Combinatorics. Abstracts from the workshop held January 4--9, 2026

This page was built for publication: Ramsey numbers and the Zarankiewicz problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614901)