Ramsey and Gallai-Ramsey numbers for linear forests and kipas

Ping Li, Yaping Mao, Ingo Schiermeyer +1

For two graphs $G,H$, the \emph{Ramsey number} $r(G,H)$ is the minimum integer $n$ such that any red/blue edge-coloring of $K_n$ contains either a red copy of $G$ or a blue copy of…