Year: 2026
Type: preprint
Abstract: We determine the $k$-colour size--Ramsey number of even cycles up to absolute constant factors. For every $k\ge2$ and every even $n\ge100\log k$, \[ \widehat R_k(C_n)=Θ(k^2\log k)n. \] The lower bound follows from the corresponding result of Beke, Li and Sahasrabudhe for paths, while our upper bound improves the previous best estimate $O(k^{34}n)$ of Javadi, Kohayakawa and Miralaei.
Source: arXiv (Cornell University)
Authors: Wang, Lanchao, Wang, Xiaolin
Institutions: Nanjing University, Institute for Basic Science, Fuzhou University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Awards: G2485548420, G2765210714, G5506417209
OpenAlex ID: W7204903360