The Ramsey number of diamond-matchings and loose cycles in hypergraphs

András Gyárfás, Gábor N. Sárkózyy, Endre Szemerédi

Research output: Article

19 Citations (Scopus)

Abstract

The 2-color Ramsey number R(Cn3, Cn 3) of a 3-uniform loose cycle Cn is asymptotic to 5n/4 as has been recently proved by Haxell, Łuczak, Peng, Rödl, Ruciński, Simonovits and Skokan. Here we extend their result to the r-uniform case by showing that the corresponding Ramsey number is asymptotic to (2r-1)n/2r-2. Partly as a tool, partly as a subject of its own, we also prove that for r ≥ 2, R(kDr, kDr) = k(2r - 1) -1 and R(kDr, kDr, kDr) = 2kr - 2 where kDr is the hypergraph having k disjoint copies of two r-element hyperedges intersecting in two vertices.

Original languageEnglish
Article numberR126
JournalElectronic Journal of Combinatorics
Volume15
Issue number1 R
Publication statusPublished - okt. 13 2008

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this