The Ramsey number of loose paths in 3-uniform hypergraphs
Combinatorics
2012-12-06 v3
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 , we show that
Keywords
Cite
@article{arxiv.1209.4159,
title = {The Ramsey number of loose paths in 3-uniform hypergraphs},
author = {Leila Maherani and Gholamreza Omidi and Ghaffar Raeisi and Maryam Shahsiah},
journal= {arXiv preprint arXiv:1209.4159},
year = {2012}
}