UPPER BOUNDS FOR THE SIZE RAMSEY P3 VERSUS C3^t OR Pn

In this paper, we derive an upper bound for the size Ramsey number for a path P3 versus a friendship graph C3^t . Furthermore, some minimal Ramsey graph for a combination (P3;C3^t ) is presented. We also give an upper bound of the size Ramsey number for P3 versus Pn.