Abstract: For given two graphs and and integer the size multipartite Ramsey numbers
is the smallest integer such that
every factorization of graph satisfies the following condition:
either contains as a subgraph or contains as a subgraph. In this paper, we
establish exact value of the size multipartite Ramsey number for all integers and or 4, where is a path on n
vertices and is a cycle on three vertices.
