论文标题
在拉姆西的雏菊号码上
On the Ramsey number of daisies I
论文作者
论文摘要
雏菊是Bollobás，Leader和Malvenuto引入的特殊类型的超图。由$ r $ -daisy由一对脱节集$ k $和$ m $确定的是$（r+| k |）$ - 统一hypergraph $ \ {k \ cup p：\：p \：p \ in m^{（r）} \} $。在[combin。概率。计算。 20，没有。 5，743-747，2011]作者研究了雏菊的Turán型密度问题。本文涉及拉姆齐的雏菊数字，这是古典拉姆西数字的自然概括。我们讨论了$ r $ daisies的Ramsey数量以及内核大小有限的特殊情况的上限和下限。
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.
