On the Ramsey number of daisies II

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 $\mathrm{\mid }K\mathrm{\mid }=k$, $\mathrm{\mid }M\mathrm{\mid }=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.