New lower bounds for hypergraph Ramsey numbers

DOI10.1112/blms.12133zbMath1386.05190arXiv1702.05509OpenAlexW2963037022MaRDI QIDQ4637550

Andrew Suk, Dhruv Mubayi

Publication date: 24 April 2018

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

Full work available at URL: https://arxiv.org/abs/1702.05509

zbMATH Keywords

lower boundsMarkov inequality\(k\)-uniform hypergraphhypergraph Ramsey numbersdouble exponentialErdős-Hajnal stepping-up lemmaoff-diagonal hypergraph Ramsey numbers

Mathematics Subject Classification ID

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

Related Items (4)

A note on the Erdős-Hajnal hypergraph Ramsey problem ⋮ The Erdős-Hajnal hypergraph Ramsey problem ⋮ Ramsey numbers of semi-algebraic and semi-linear hypergraphs ⋮ Hypergraph Ramsey numbers of cliques versus stars

This page was built for publication: New lower bounds for hypergraph Ramsey numbers