The Ramsey Number of Loose Paths in 3-Uniform Hypergraphs

  • Leila Maherani
  • Gholam Reza Omidi
  • Ghaffar Raeisi
  • Maryam Shahsiah
Keywords: Ramsey Number, Loose Path, Loose Cycle

Abstract

Recently, asymptotic values of 2-color Ramsey numbers for loose cycles and also loose paths were determined. Here we determine the 2-color Ramsey number of 3-uniform loose paths when one of the paths is significantly larger than the other:  for every n5m4, we show that R(P3n,P3m)=2n+m+12.
Published
2013-01-21
Article Number
P12