An improved bound for the stepping-up lemma

DOI10.1016/j.dam.2010.10.013zbMath1277.05115arXiv0907.0283OpenAlexW2115582932WikidataQ125056592 ScholiaQ125056592MaRDI QIDQ385142

Jacob Fox, David Conlon, Benjamin Sudakov

Publication date: 29 November 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraph Ramsey numbersstepping-up lemma

Mathematics Subject Classification ID

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

Related Items

Ramsey properties of algebraic graphs and hypergraphs ⋮ Ramsey-type results for semi-algebraic relations ⋮ Off-diagonal hypergraph Ramsey numbers ⋮ Boolean lattices: Ramsey properties and embeddings ⋮ The Erdős-Hajnal hypergraph Ramsey problem ⋮ On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs ⋮ On high-dimensional acyclic tournaments ⋮ Hypergraph Ramsey numbers of cliques versus stars ⋮ Ramsey numbers with prescribed rate of growth ⋮ A Note on Induced Ramsey Numbers ⋮ Multicolor Ramsey numbers for triple systems ⋮ Higher-order Erdős-Szekeres theorems ⋮ Some remarks on vertex Folkman numbers for hypergraphs ⋮ Erdős-Hajnal-type theorems in hypergraphs ⋮ Hypergraph Ramsey numbers: tight cycles versus cliques ⋮ Lower bounds on the clique-chromatic numbers of some distance graphs

Cites Work

• A new upper bound for diagonal Ramsey numbers
• The early evolution of the \(H\)-free process
• A note on Ramsey numbers
• Asymptotic lower bounds for Ramsey functions
• Hypergraph Ramsey numbers
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Partition relations for cardinal numbers
• Some remarks on the theory of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item