Yuang Yang

Single-graph rational exponents in mixed multicolour Ramsey theory

For every rational number $\gamma>1$, we construct a fixed bipartite graph $H_\gamma$ such that $r_k(H_\gamma;K_N)=\Theta_{\gamma,k}((N/\log N)^\gamma)$ for every fixed $k\ge 3$. Here $r_k(H;K_N)=r(H,\ldots,H,K_N)$, with $k$ copies of $H$. The lower bound uses a symmetric random algebraic graph which avoids a fixed roo...