The Erdős-Hajnal hypergraph Ramsey problem

DOI10.4171/JEMS/944zbMath1439.05218arXiv1602.08716MaRDI QIDQ2178253

Andrew Suk, Dhruv Mubayi

Publication date: 7 May 2020

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

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

zbMATH Keywords

hypergraph Ramsey numbersstepping-up lemma

Mathematics Subject Classification ID

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

Related Items

Off-diagonal hypergraph Ramsey numbers, A note on the Erdős-Hajnal hypergraph Ramsey problem

Cites Work

• Unnamed Item
• An improved bound for the stepping-up lemma
• On high-dimensional acyclic tournaments
• Note on upper density of quasi-random hypergraphs
• Ordered Ramsey theory and track representations of graphs
• Weak hypergraph regularity and linear hypergraphs
• The early evolution of the \(H\)-free process
• The triangle-free process
• A note on Ramsey numbers
• Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
• Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
• Higher-order Erdős-Szekeres theorems
• Erdős-Szekeres-type theorems for monotone paths and convex bodies
• Hypergraph Ramsey numbers
• [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
• New lower bounds for hypergraph Ramsey numbers
• Constructions in Ramsey theory
• The poset of hypergraph quasirandomness
• EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
• Partition relations for cardinal numbers
• Some remarks on the theory of graphs
• Combinatorial Theorems on Classifications of Subsets of a Given Set