Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques

DOI10.1017/S0963548316000080zbMath1372.05149arXiv1511.09104MaRDI QIDQ5366921

Dhruv Mubayi

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• The early evolution of the \(H\)-free process
• A note on Ramsey numbers
• Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
• Turan's theorem for \(k\)-graphs
• A new lower bound for a Ramsey-type problem
• Hypergraph Ramsey numbers: tight cycles versus cliques
• Hypergraph Ramsey numbers
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• On independent sets in hypergraphs
• Dynamic concentration of the triangle-free process

This page was built for publication: Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques