Gallai-Ramsey number for the union of stars

Yaping Mao, Zhao Wang, Colton Magnant +1

Given a graph $G$ and a positive integer $k$, define the \emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$-edge coloring of the complete graph…