The Ramsey Number of Loose Triangles and Quadrangles in Hypergraphs

  • Andras Gyarfas
  • Ghaffar Raeisi
Keywords: Hypergraph Ramsey Number, Loose Cycle, Loose Path

Abstract

Asymptotic values of hypergraph Ramsey numbers for loose cycles (and paths) were determined recently. Here we determine some of them exactly, for example the 2-color hypergraph Ramsey number of a k-uniform loose 3-cycle or 4-cycle: R(Ck3,Ck3)=3k2 and R(Ck4,Ck4)=4k3 (for k3). For more than 3-colors we could prove only that R(C33,C33,C33)=8. Nevertheless, the r-color Ramsey number of triangles for hypergraphs are much smaller than for graphs: for r3, r+5R(C33,C33,,C33)3r

Published
2012-06-06
Article Number
P30