Upper bounds for the size ramsey numbers for p3 versus c3 or pn. | [Journal of Prime Research in Mathematics • 2006]

Author(s):

1. E. T. Baskoro: Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institute Teknologi Bandung, Jalan Ganesa 10 Bandung 40132 Indonesia

2. Y. Nuraeni: Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institute Teknologi Bandung, Jalan Ganesa 10 Bandung 40132 Indonesia

3. A. A. G. Ngurah: Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institute Teknologi Bandung, Jalan Ganesa 10 Bandung 40132 Indonesia

4. E. T. Baskoro: School of Mathematical Sciences, GC University, 68-B, New Muslim Town, Lahore, Pakistan

Abstract:

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

Page(s): 141-146

DOI: DOI not available

Published: Journal: Journal of Prime Research in Mathematics, Volume: 2, Issue: 0, Year: 2006

Keywords:

Keywords are not available for this article.

References:

References are not available for this document.

Citations

Citations are not available for this document.

Citations

Downloads

Views