Degree Ramsey numbers for even cycles

Let $H\xrightarrow{s} G$ denote that any $s$-coloring of $E(H)$ contains a monochromatic $G$. The degree Ramsey number of a graph $G$, denoted by $R_Δ(G, s)$, is $\min \{Δ(H): H \xrightarrow{s} G \}$. We consider degree Ramsey numbers where $G$ is a fixed even cycle. Kinnersley, Milans, and West showed that $R_Δ(C_{2k},s) \geq 2s$, and Kang and Perarnau showed that $R_Δ(C_4, s) = Θ(s^2)$. Our main result is that $R_Δ(C_6, s) = Θ(s^{3/2})$ and $R_Δ(C_{10}, s) = Θ(s^{5/4})$. Additionally, we substantially improve the lower bound for $R_Δ(C_{2k}, s)$ for general $k$.

No reviews yet.

No comments yet.