English

A polynomial improvement for the odd cycle-complete Ramsey numbers

Combinatorics 2026-05-05 v2

Abstract

We give a polynomial improvement to the cycle-complete Ramsey numbers r(C,Kk)k1+1/(2)+ε+o(1), r(C_{\ell},K_k) \geq k^{1+1/(\ell- 2) + \varepsilon_{\ell} + o(1)}, for all fixed odd >7\ell > 7 with kk \rightarrow \infty, for some ε>0\varepsilon_{\ell} > 0.

Keywords

Cite

@article{arxiv.2511.10641,
  title  = {A polynomial improvement for the odd cycle-complete Ramsey numbers},
  author = {Marcelo Campos and Matthew Jenssen and Marcus Michelen and Florian Pfender and Julian Sahasrabudhe},
  journal= {arXiv preprint arXiv:2511.10641},
  year   = {2026}
}
R2 v1 2026-07-01T07:36:24.358Z