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

Meng Ji

The size-Ramsey number ${\hat{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…