Infinitely many size-Ramsey numbers of $k$-uniform relaxed $\ell$-trees are not polynomial

Source abstract

The size-Ramsey number $\widehat{R}_k(\mathcal G)$ of a $k$-uniform hypergraph $\mathcal G$ is the minimum number of edges in a $k$-uniform hypergraph $\mathcal H$ such that every $2$-edge-coloring of $\mathcal H$ contains a monochromatic copy of $\mathcal G$. The following question was pointed out by Fox and recorded by Dudek, La Fleur, Mubayi and Rödl~\cite{Dudek-Fleur-Mubayi-Rodl}: for fixed $2\le \ell 0$ depending only on $k$ and $\ell$.