English

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 R(C3r,Knr)=θ~(n3/2)R(C^r_3,K^r_n) = \tilde{\theta}(n^{3/2}) for all fixed r3r\geq 3. For the case of loose cycles of length five they proved that R(C5r,Knr)=Ω((n/logn)5/4)R(C_5^r,K_n^r)=\Omega((n/\log n)^{5/4}) and conjectured that R(C5r,Knr)=O(n5/4)R(C^r_5,K_n^r) = O(n^{5/4}) for all fixed r3r\geq 3. Our main result is that R(C53,Kn3)=O(n4/3)R(C_5^3,K_n^3) = O(n^{4/3}) and more generally for any fixed l3l\geq 3 that R(Cl3,Kn3)=O(n1+1/(l+1)/2)R(C_l^3,K_n^3) = O(n^{1 + 1/\lfloor(l+1)/2 \rfloor}). We also explain why for every fixed l5l\geq 5, r4r\geq 4, R(Clr,Knr)=O(n1+1/l/2)R(C^r_l,K^r_n) = O(n^{1+1/\lfloor l/2 \rfloor}) if ll is odd, which improves upon the result of Collier-Cartaino, Graber and Jiang who proved that for every fixed r3r\geq 3, l4l\geq 4, we have R(Clr,Knr)=O(n1+1/(l/21))R(C_l^r,K_n^r) = O(n^{1 + 1/(\lfloor l/2 \rfloor-1)}).

Keywords

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