The Ramsey number of the clique and the hypercube

DOI10.1112/jlms/jdu004zbMath1295.05253arXiv1306.0461OpenAlexW1994526721MaRDI QIDQ5494398

Jozef Skokan, Gonzalo Fiz Pontiveros, Simon Griffiths, David Saxton, Robert Morris

Publication date: 28 July 2014

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

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

Mathematics Subject Classification ID

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

Related Items (6)

Ramsey goodness of paths ⋮ Ramsey Goodness of Cycles ⋮ Ramsey Goodness of Bounded Degree Trees ⋮ Ramsey Goodness of Clique Versus Paths in Random Graphs ⋮ Ramsey numbers of cubes versus cliques ⋮ The Ramsey number of Fano plane versus tight path

Cites Work

• Ramsey numbers of cubes versus cliques
• A new upper bound for diagonal Ramsey numbers
• Edge disjoint placement of graphs
• Density theorems for bipartite graphs and related Ramsey-type results
• Ramsey goodness and beyond
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• On the combinatorial problems which I would most like to see solved
• Ramsey's theorem - a new lower bound
• Ramsey-goodness -- and otherwise
• Freiman Homomorphisms of Random Subsets of
• Dependent random choice
• Hypergraph Packing and Sparse Bipartite Ramsey Numbers
• Generalizations of a Ramsey-theoretic result of chvátal
• An upper bound for some ramsey numbers
• A Separator Theorem for Nonplanar Graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Some remarks on the theory of graphs

This page was built for publication: The Ramsey number of the clique and the hypercube