The Ramsey number of loose cycles versus cliques
Combinatorics
2015-04-15 v1
Abstract
Recently Kostochka, Mubayi and Verstra\"ete initiated the study of the Ramsey numbers of uniform loose cycles versus cliques. In particular they proved that for all fixed . For the case of loose cycles of length five they proved that and conjectured that for all fixed . Our main result is that and more generally for any fixed that . We also explain why for every fixed , , if is odd, which improves upon the result of Collier-Cartaino, Graber and Jiang who proved that for every fixed , , we have .
Cite
@article{arxiv.1504.03668,
title = {The Ramsey number of loose cycles versus cliques},
author = {Arès Méroueh},
journal= {arXiv preprint arXiv:1504.03668},
year = {2015}
}
Comments
18 pages