Qi-Zhong Lin

Polynomially superlinear growth of set-coloring Ramsey numbers

The set-coloring Ramsey number $R(k;r,s)$ is the least $N$ such that every assignment of an $s$-element subset of $[r]$ to each edge of $K_N$ yields a copy of $K_k$ whose edges share a common color. For every fixed prime power $q$, we construct infinitely many positive integer triples $(r,j,s)$ with $j\sim(q-1)^{-2/3}r...