Gallai-Ramsey numbers for rainbow paths

Xihe Li, Pierre Besse, Colton Magnant +2

Given graphs $G$ and $H$ and a positive integer $k$, the \emph{Gallai-Ramsey number}, denoted by $g{r}_k(G:H)$ is defined to be the minimum integer $n$ such that every coloring o…