Ramsey numbers and the Zarankiewicz problem
From MaRDI portal
Publication:6614901
DOI10.1112/BLMS.13040zbMATH Open1548.05229MaRDI QIDQ6614901FDOQ6614901
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)
Recommendations
Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- The nonexistence of certain generalized polygons
- Title not available (Why is that?)
- The Ramsey number R(3, t) has order of magnitude t2/log t
- A note on the independence number of triangle-free graphs
- A note on Ramsey numbers
- On the number of graphs without 4-cycles
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- Title not available (Why is that?)
- The triangle-free process and the Ramsey number \(R(3,k)\)
- The early evolution of the \(H\)-free process
- Ramsey numbers for cycles in graphs
- On cycle—Complete graph ramsey numbers
- The size of bipartite graphs with a given girth
- A note on odd cycle-complete graph Ramsey numbers
- Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
- Extremal problems for cycles in graphs
- Improved bounds for the extremal number of subdivisions
- The method of hypergraph containers
- Dynamic concentration of the triangle‐free process
- A note on pseudorandom Ramsey graphs
- The asymptotics of \(r(4,t)\)
Cited In (1)
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)