Ramsey numbers and Gallai--Ramsey numbers of disjoint unions of cherries

Yanbo Zhang, Qian Chen, Yaojun Chen

For graphs $G_1,\dots ,G_k$, the Ramsey number $R(G_1,\dots ,G_k)$ is the smallest positive integer $N$ such that every $k$-edge-coloring of $K_N$ contains a monochromatic copy of…