Gallai-Ramsey number of an 8-cycle

Jonathan Gregory, Colton Magnant, Zhuojun Magnant

Given graphs $G$ and $H$ and a positive integer $k$, the Gallai-Ramsey number $g{r}_k(G:H)$ is the minimum integer $N$ such that for any integer $n\ge N$, every $k$-edge-colori…