On the Ramsey number of daisies I
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911921119166464 |
|---|---|
| author | Pudlák, Pavel Rödl, Vojtěch Sales, Marcelo |
| author_facet | Pudlák, Pavel Rödl, Vojtěch Sales, Marcelo |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_10377 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | On the Ramsey number of daisies I Pudlák, Pavel Rödl, Vojtěch Sales, Marcelo Combinatorics 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. |
| title | On the Ramsey number of daisies I |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2211.10377 |