Multicolor Ramsey numbers via pseudorandom graphs

TL;DR

This paper establishes bounds on multicolor Ramsey numbers using pseudorandom graphs that are weakly optimal and $K_s$-free, extending previous results by considering a broader class of graphs.

Contribution

It generalizes existing bounds on multicolor Ramsey numbers by employing weakly optimal pseudorandom graphs, broadening the scope beyond optimal graphs.

Findings

Bounds on $r(s_1,...,s_k,t)$ are established with explicit asymptotic formulas.

Extends previous results to cases with multiple colors and larger clique sizes.

Utilizes pseudorandom graphs to improve understanding of multicolor Ramsey numbers.

Abstract

A weakly optimal $K_s$-free $(n,d,\lambda)$-graph is a $d$-regular $K_s$-free graph on $n$ vertices with $d=\Theta(n^{1-\alpha})$ and spectral expansion $\lambda=\Theta(n^{1-(s-1)\alpha})$, for some fixed $\alpha>0$. Such a graph is called optimal if additionally $\alpha = \frac{1}{2s-3}$. We prove that if $s_{1},\ldots,s_{k}\ge3$ are fixed positive integers and weakly optimal $K_{s_{i}}$-free pseudorandom graphs exist for each $1\le i\le k$, then the multicolor Ramsey numbers satisfy \[ \Omega\Big(\frac{t^{S+1}}{\log^{2S}t}\Big)\le r(s_{1},\ldots,s_{k},t)\le O\Big(\frac{t^{S+1}}{\log^{S}t}\Big), \] as $t\rightarrow\infty$, where $S=\sum_{i=1}^{k}(s_{i}-2)$. This generalizes previous results of Mubayi and Verstra\"ete, who proved the case $k=1$, and Alon and R\"odl, who proved the case $s_1=\cdots = s_k = 3$. Both previous results used the existence of optimal rather than weakly optimal $K_{s_i}$-free graphs.