在一个连通分支里的图的不交并的拉姆齐数

For a graph $G$, $R(c(nG))$ denotes the least positive integer $N$ such that every 2-colouring of the edges of $K_N$ contains a copy of $nG$ in a monochromatic component, where $nG$ denotes the graph consisting of $n$ vertex disjoint copies of $G$.Gy\'{a}f\'{a}s and S\'{a}rk\"{o}zy showed that $R(c(nK_3))=7n-2$ for $n \geq 2$ in 2016.After that, Roberts showed that $R(c(nK_r))=(r^2-r+1)n-r+1$ for $r \geq 4$ and $n \geq R(K_r)$ in 2017.This paper determines the values of $R(c(n(K_{1,3}+e)))$ and $R(c(n(K_4-e)))$.