Abstract: For graphs Gand H, the size
multipartite Ramsey number is the least
natural number tsuch
that for every factorization of graph satisfies the
following condition: either contains G
orcontains
H. In this paper, we determine the size multipartite Ramsey numbers where is a path on 3
vertices and is a cocktail party
graph with
Keywords and phrases: cocktail party graph, path, size multipartite Ramsey numbers.
