Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2211.10385 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910491510571008 |
|---|---|
| author | Sales, Marcelo |
| author_facet | Sales, Marcelo |
| contents | A $(k+r)$-uniform hypergraph $H$ on $(k+m)$ vertices is an $(r,m,k)$-daisy if there exists a partition of the vertices $V(H)=K\cup M$ with $|K|=k$, $|M|=m$ such that the set of edges of $H$ is all the $(k+r)$-tuples $K\cup P$, where $P$ is an $r$-tuple of $M$. Complementing results in ["On the Ramsey number of daisies I"], we obtain an $(r-2)$-iterated exponential lower bound to the Ramsey number of an $(r,m,k)$-daisy for $2$-colors. This matches the order of magnitude of the best lower bounds for the Ramsey number of a complete $r$-graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_10385 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | On the Ramsey number of daisies II Sales, Marcelo Combinatorics A $(k+r)$-uniform hypergraph $H$ on $(k+m)$ vertices is an $(r,m,k)$-daisy if there exists a partition of the vertices $V(H)=K\cup M$ with $|K|=k$, $|M|=m$ such that the set of edges of $H$ is all the $(k+r)$-tuples $K\cup P$, where $P$ is an $r$-tuple of $M$. Complementing results in ["On the Ramsey number of daisies I"], we obtain an $(r-2)$-iterated exponential lower bound to the Ramsey number of an $(r,m,k)$-daisy for $2$-colors. This matches the order of magnitude of the best lower bounds for the Ramsey number of a complete $r$-graph. |
| title | On the Ramsey number of daisies II |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2211.10385 |