Single-graph rational exponents in mixed multicolour Ramsey theory

Source abstract

For every rational number $γ>1$, we construct a fixed bipartite graph $H_γ$ such that $r_k(H_γ;K_N)=Θ_{γ,k}((N/\log N)^γ)$ 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 rooted power and has sufficiently strong local density for the Alon-Rodl method. The main algebraic step establishes a nonzero obstruction within the full symmetric coefficient space; the upper bound uses the rooted graphs from the proof of the rational exponents conjecture. We also obtain induced even-cycle asymptotics in the same construction.