Upper bounds for the size Ramsey numbers for P 3 versus C t 3 or P n

Authors

  • E.T. BASKORO (1)Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jalan Ganesa 10 Bandung 40132 Indonesia. (2) School of Mathematical Sciences, GC University, 68-B, New Muslim Town, Lahore, Pakistan.
  • Y. NURAENI Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jalan Ganesa 10 Bandung 40132 Indonesia.

Keywords:

Size Ramsey number, path, friendship graph

Abstract

In this paper, we derive an upper bound for the size Ramsey number for a path P3P3 versus a friendship graph Ct3C3t. Furthermore, some minimal Ramsey graph for a combination (P3,Ct3)(P3,C3t)is presented. We also give an upper bound of the size Ramsey number for P3P3 versus PnPn.

Downloads

Download data is not yet available.

Downloads

Published

2006-12-31

Issue

Vol. 2 No. 1 (2006): Journal of Prime Research in Mathematics

Section

Regular

How to Cite

Upper bounds for the size Ramsey numbers for P 3 versus C t 3 or P n. (2006). Journal of Prime Research in Mathematics, 2(1), 141 – 146. https://jprm.sms.edu.pk/index.php/jprm/article/view/18