Gallai-Ramsey number of even cycles with chords

Fangfang Zhang, Zi-Xia Song, Yaojun Chen

For a graph $H$ and an integer $k\ge 1$, the $k$-color Ramsey number $R_k(H)$ is the least integer $N$ such that every $k$-coloring of the edges of the complete graph $K_N$ contains…