A polynomial improvement for the odd cycle-complete Ramsey numbers
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915972958388224 |
|---|---|
| author | Campos, Marcelo Jenssen, Matthew Michelen, Marcus Pfender, Florian Sahasrabudhe, Julian |
| author_facet | Campos, Marcelo Jenssen, Matthew Michelen, Marcus Pfender, Florian Sahasrabudhe, Julian |
| contents | We give a polynomial improvement to the cycle-complete Ramsey numbers \[ r(C_{\ell},K_k) \geq k^{1+1/(\ell- 2) + \varepsilon_{\ell} + o(1)}, \] for all fixed odd $\ell > 7$ with $k \rightarrow \infty$, for some $\varepsilon_{\ell} > 0$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_10641 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A polynomial improvement for the odd cycle-complete Ramsey numbers Campos, Marcelo Jenssen, Matthew Michelen, Marcus Pfender, Florian Sahasrabudhe, Julian Combinatorics 05D10, 05D40 We give a polynomial improvement to the cycle-complete Ramsey numbers \[ r(C_{\ell},K_k) \geq k^{1+1/(\ell- 2) + \varepsilon_{\ell} + o(1)}, \] for all fixed odd $\ell > 7$ with $k \rightarrow \infty$, for some $\varepsilon_{\ell} > 0$. |
| title | A polynomial improvement for the odd cycle-complete Ramsey numbers |
| topic | Combinatorics 05D10, 05D40 |
| url | https://arxiv.org/abs/2511.10641 |