Hypergraph Ramsey numbers: tight cycles versus cliques

DOI10.1112/blms/bdv084zbMath1330.05114arXiv1503.03855OpenAlexW3102237212MaRDI QIDQ2788661

Dhruv Mubayi, Vojtěch Rödl

Publication date: 22 February 2016

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

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

zbMATH Keywords

3-uniform tight cycle \(C^3_s\)

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (1)

Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques

Cites Work

• An improved bound for the stepping-up lemma
• The early evolution of the \(H\)-free process
• A note on Ramsey numbers
• A note on the independence number of triangle-free graphs. II
• 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
• A new lower bound for a Ramsey-type problem
• Hypergraph Ramsey numbers
• The Ramsey number R(3, t) has order of magnitude t²/log t
• On independent sets in hypergraphs
• Dynamic concentration of the triangle-free process

This page was built for publication: Hypergraph Ramsey numbers: tight cycles versus cliques