Gallai-Ramsey numbers of $C_9$ with multiple colors

Christian Bosse, Zi-Xia Song

We study Ramsey-type problems in Gallai-colorings. Given a graph $G$ and an integer $k\ge 1$, the Gallai-Ramsey number $g{r}_k(K_3,G)$ is the least positive integer $n$ such that ever…