“…Given any two coloring (consisting of say red and blue colors) of the edges of a graph K j×s , we say that K j×s → (P 4 ,G), if there exists a red copy of P 4 in K j×s or a blue copy of Gin K j×s . The size Ramsey multipartite number m j (P 4 ,G) is defined as the smallest natural number t such that K j×t → (P 4 ,G) (see [1,3,4,5,6,7] for general cases of m j (H,G)). In this paper, we exhaustively find m j (P 4 ,G) for all 11 non-isomorphic graphs G on 4 vertices.…”