Ramsey numbers and the Zarankiewicz problem

DOI10.1112/BLMS.13040zbMATH Open1548.05229MaRDI QIDQ6614901

Sam Mattheus, Jacques Verstraëte, Dhruv Mubayi, David Conlon

Publication date: 8 October 2024

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The early evolution of the \(H\)-free process
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• On the number of graphs without 4-cycles
• The size of bipartite graphs with a given girth
• Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
• Improved bounds for the extremal number of subdivisions
• The nonexistence of certain generalized polygons
• Ramsey numbers for cycles in graphs
• Extremal problems for cycles in graphs
• On cycle—Complete graph ramsey numbers
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• THE METHOD OF HYPERGRAPH CONTAINERS
• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• A note on odd cycle-complete graph Ramsey numbers
• Dynamic concentration of the triangle‐free process
• A note on pseudorandom Ramsey graphs
• The asymptotics of \(r(4,t)\)

Related Items (1)

Ramsey numbers and a general Erdős-Rogers function

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)