Ramsey Number of a Connected Triangle Matching

DOI10.1002/jgt.21913zbMath1346.05181arXiv1509.05530OpenAlexW3121371712MaRDI QIDQ2825485

Gábor N. Sárközy, András Gyárfás

Publication date: 13 October 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.05530

zbMATH Keywords

Ramsey numbertriangle matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (1)

Gallai-Ramsey numbers for rainbow paths

Cites Work

• On two problems in graph Ramsey theory
• Partitioning 3-colored complete graphs into three monochromatic cycles
• The Ramsey number of a graph with bounded maximum degree
• An improved bound for the monochromatic cycle partition number
• The Ramsey number for a triple of long even cycles
• How to avoid using the regularity Lemma: Pósa's conjecture revisited
• The Ramsey number of diamond-matchings and loose cycles in hypergraphs
• Blow-up lemma
• Ramsey-goodness -- and otherwise
• Three-color Ramsey numbers for paths
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
• The Ramsey number for stripes
• An algorithmic version of the blow-up lemma
• On the square of a Hamiltonian cycle in dense graphs
• Ramsey Theorems for Multiple Copies of Graphs
• Pósa's conjecture for graphs of order at least 2 × 10⁸
• On the maximal number of independent circuits in a graph

This page was built for publication: Ramsey Number of a Connected Triangle Matching