On zero-sum Ramsey numbers of cycles and wheels
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913135850422272 |
|---|---|
| author | Chi, Cheng He, Jialin |
| author_facet | Chi, Cheng He, Jialin |
| contents | For an integer $q\ge 2$ and a graph $F$ with $q\mid e(F)$, let $R(F,\Z_q)$ be the least integer $n$ such that every edge-labeling $w\colon E(K_n)\to \Z_q$ contains a copy of $F$ whose edge-label sum is zero in $\Z_q$. Write $C_{qk}$ for the cycle on $qk$ vertices. We prove that $R(C_{qk},\Z_q)\le \max\{R(C_{2q},\Z_q),qk+q-1\}$ via an insertion argument rooted in the classic Erdős-Ginzburg-Ziv theorem. Combined with Pikhurko's result, we obtain $R(C_{qk},\Z_q)\le \max\{35q^2,qk+q-1\}$ for every $q\ge 3$. We also show that $R(C_{qk},\Z_q)\ge qk+q-1$ for odd $q\ge 3$. Hence, for every fixed odd $q\ge 3$ and every $k\ge 35q$, we obtain the exact value $R(C_{qk},\Z_q)=qk+q-1$. For even $q\ge 4$, the same method gives $qk+\frac q2-1\le R(C_{qk},\Z_q)\le \max\{35q^2,qk+q-1\}$, leaving an additive gap of order $q/2$ when $k$ is large. Moreover, for the case $q=3$, we prove that \(R(C_{3k}, \mathbb{Z}_3) = 3k + 2\) for all \(k \ge 2\). Extending our techniques beyond cycles, we also resolve the zero-sum Ramsey number for wheel graphs \(W_m = C_m + K_1\), proving that \(R(W_{3k}, \mathbb{Z}_3) = 3k + 1\) for all \(k \ge 2\). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_14954 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On zero-sum Ramsey numbers of cycles and wheels Chi, Cheng He, Jialin Combinatorics For an integer $q\ge 2$ and a graph $F$ with $q\mid e(F)$, let $R(F,\Z_q)$ be the least integer $n$ such that every edge-labeling $w\colon E(K_n)\to \Z_q$ contains a copy of $F$ whose edge-label sum is zero in $\Z_q$. Write $C_{qk}$ for the cycle on $qk$ vertices. We prove that $R(C_{qk},\Z_q)\le \max\{R(C_{2q},\Z_q),qk+q-1\}$ via an insertion argument rooted in the classic Erdős-Ginzburg-Ziv theorem. Combined with Pikhurko's result, we obtain $R(C_{qk},\Z_q)\le \max\{35q^2,qk+q-1\}$ for every $q\ge 3$. We also show that $R(C_{qk},\Z_q)\ge qk+q-1$ for odd $q\ge 3$. Hence, for every fixed odd $q\ge 3$ and every $k\ge 35q$, we obtain the exact value $R(C_{qk},\Z_q)=qk+q-1$. For even $q\ge 4$, the same method gives $qk+\frac q2-1\le R(C_{qk},\Z_q)\le \max\{35q^2,qk+q-1\}$, leaving an additive gap of order $q/2$ when $k$ is large. Moreover, for the case $q=3$, we prove that \(R(C_{3k}, \mathbb{Z}_3) = 3k + 2\) for all \(k \ge 2\). Extending our techniques beyond cycles, we also resolve the zero-sum Ramsey number for wheel graphs \(W_m = C_m + K_1\), proving that \(R(W_{3k}, \mathbb{Z}_3) = 3k + 1\) for all \(k \ge 2\). |
| title | On zero-sum Ramsey numbers of cycles and wheels |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2605.14954 |