### Abstract

We determine the 2-color Ramsey number of a connected triangle matching c(nK_{3}) that is any connected graph containing n vertex disjoint triangles. We obtain that R(c(nK_{3}), c(nK_{3}) = 7n-2 somewhat larger than in the classical result of Burr, Erdős, and Spencer for a triangle matching, R(nK_{3}, nK_{3}) = 5n. The motivation is to determine the Ramsey number R(C^{2} _{n}, C^{2} _{n}) of the square of a cycle C^{2} _{n}. We apply our Ramsey result for connected triangle matchings to show that the Ramsey number of an “almost” square of a cycle C^{2, c} _{n} (a cycle of length n in which all but at most a constant number c of short diagonals are present) is asymptotic to 7n/3.

Original language | English |
---|---|

Pages (from-to) | 109-119 |

Number of pages | 11 |

Journal | Journal of Graph Theory |

Volume | 83 |

Issue number | 2 |

DOIs | |

Publication status | Published - Oct 1 2016 |

### Keywords

- Ramsey
- triangle matching

### ASJC Scopus subject areas

- Geometry and Topology

## Fingerprint Dive into the research topics of 'Ramsey Number of a Connected Triangle Matching'. Together they form a unique fingerprint.

## Cite this

*Journal of Graph Theory*,

*83*(2), 109-119. https://doi.org/10.1002/jgt.21913