Gallai-Ramsey numbers involving a rainbow $4$-path

Jinyu Zou, Zhao Wang, Hong-Jian Lai +1

Given two non-empty graphs $G,H$ and a positive integer $k$, the Gallai-Ramsey number ${\mathrm{gr}}_k(G:H)$ is defined as the minimum integer $N$ such that for all $n\ge N$,…