Hypergraph Ramsey numbers of cliques versus stars

DOI10.1002/rsa.21155arXiv2210.03545MaRDI QIDQ6076729

Xiaoyu He, Dhruv Mubayi, Andrew Suk, Jacob Fox, David Conlon, Jacques Verstraete

Publication date: 17 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theoryprobabilistic methodhypergraph Ramsey numbersstepping up

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

A lower bound for set‐coloring Ramsey numbers

Cites Work

• Unnamed Item
• The independent neighborhoods process
• An improved bound for the stepping-up lemma
• A note on Ramsey numbers
• Off-diagonal hypergraph Ramsey numbers
• On a Ramsey type theorem
• On the Grid Ramsey Problem and Related Questions: Fig. 1.
• Recent developments in graph Ramsey theory
• Hypergraph Ramsey numbers
• Primitive Recursive Bounds for Van Der Waerden Numbers
• New lower bounds for hypergraph Ramsey numbers
• Polynomial to exponential transition in Ramsey theory
• Independent sets in hypergraphs with a forbidden link
• Combinatorial Theorems on Classifications of Subsets of a Given Set

This page was built for publication: Hypergraph Ramsey numbers of cliques versus stars