The Ramsey Number for a Forest versus Disjoint Union of Complete Graphs

Sinan Hu, Yuejian Peng

Given two graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the minimum integer $N$ such that any coloring of the edges of $K_N$ in red or blue yields a red $G$ or a blue $H$. Let…