Gallai-Ramsey numbers of odd cycles

Zhao Wang, Yaping Mao, Colton Magnant +2

Given two graphs $G$ and $H$ and a positive integer $k$, the $k$-color Gallai-Ramsey number, denoted by $g{r}_k(G:H)$, is the minimum integer $N$ such that for all $n\ge N$, ev…