When are off-diagonal hypergraph Ramsey numbers polynomial?

DOI10.1090/PROC/17321MaRDI QIDQ6917136zbMATH OpenFDO

Authors David Conlon, Jacob Fox, Benjamin Gunby, Xiaoyu He, Dhruv Mubayi, Andrew Suk, J. Verstraëte

Publication date 14 October 2025

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

Full work available at URL https://doi.org/10.1090/PROC/17321

zbMATH Keywords

off-diagonal Ramsey number

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

• A note on pseudorandom Ramsey graphs
• A note on Ramsey numbers
• Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
• Hypergraph Ramsey numbers
• Hypergraph Ramsey numbers of cliques versus stars
• Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques
• Independent sets in hypergraphs with a forbidden link
• On off-diagonal hypergraph Ramsey numbers
• Polynomial to exponential transition in Ramsey theory
• Ramsey numbers and the Zarankiewicz problem
• The asymptotics of r(4,t)
• The early evolution of the \(H\)-free process
• The probabilistic method
• The Ramsey number R(3, t) has order of magnitude t²/log t

Cited in

(1)

• Generalized Erdős-Rogers problems for hypergraphs

This page was built for publication: When are off-diagonal hypergraph Ramsey numbers polynomial?

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