On off-diagonal hypergraph Ramsey numbers

DOI10.1093/IMRN/RNAF122MaRDI QIDQ6919404zbMATH OpenFDO

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

Publication date 8 October 2025

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/IMRN/RNAF122

zbMATH Keywords

\(3\)-uniform hypergraphhypergraph Ramsey numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Hypergraphs (05C65) Ramsey theory (05D10)

Cites work

• A note on Ramsey numbers
• An improved bound for the stepping-up lemma
• Bounding Ramsey numbers through large deviation inequalities
• Coloring H-free hypergraphs
• Erdős-Hajnal-type theorems in hypergraphs
• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• Hypergraph Ramsey numbers
• Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques
• Independent sets in hypergraphs with a forbidden link
• New lower bounds for hypergraph Ramsey numbers
• On a problem of formal logic.
• The asymptotics of r(4,t)
• The Ramsey number R(3, t) has order of magnitude t²/log t

Cited in

(2)

• When are off-diagonal hypergraph Ramsey numbers polynomial?
• Generalized Erdős-Rogers problems for hypergraphs

This page was built for publication: On off-diagonal hypergraph Ramsey numbers

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