  For given graphs $G_1, G_2,\ldots, G_n$ and any integer $j$, the size of the
multipartite Ramsey number $m_j(G_1, G_2,\ldots, G_n)$ is the smallest positive
integer $t$ such that any $n$-coloring of the edges of $K_{j\times t}$ contains
a monochromatic copy of $G_i$ in color $i$ for some $i$, $1 \leq i \leq n$,
where $K_{j\times t}$ denotes the complete multipartite graph having $j$
classes with $t$ vertices per each class. In this paper we compute the size of
the multipartite Ramsey number $m_j(K_{1,2}, P_4, nK_2)$ for any $j,n\geq 2$
and $m_j(nK_2,C_7)$, for any $j\leq4$ and $n\geq 2$.
