On the Ramsey number of daisies I

Abstract

Daisies are a special type of hypergraphs introduced by Bollobás, Leader and Malvenuto. An $r$-daisy determined by a pair of disjoint sets $K$ and $M$ is the $(r+|K|)$-uniform hypergraph $\{K\cup P:P\in M^{(r)}\}$. In [Combin. Probab. Comput. 20, no. 5, 743-747, 2011] the authors studied Turán type density problems for daisies. This paper deals with Ramsey numbers of Daisies, which are natural generalizations of classical Ramsey numbers. We discuss upper and lower bounds for the Ramsey number of $r$-daisies and also for special cases where the size of the kernel is bounded.

arXiv comment14 pages