Ramsey goodness of complete multipartite graphs with one large part

Shaonan Mi, Ye Wang

For graph $G$, a connected graph $H$ of order $n$ is $G$-good if $r(G,H)=(\chi (G)-1)(n-1)+s(G)$, where $\chi (G)$ is the chromatic number of $G$ and $s(G)$ is the minimum size of a color…