Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.07322 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914543110717440 |
|---|---|
| author | Das, Shagnik Wu, Ying-Sian |
| author_facet | Das, Shagnik Wu, Ying-Sian |
| contents | The odd-Ramsey number $r_{\text{odd}}(n,H)$ of a graph $H$ is the minimum number of colors needed to edge-color $K_n$ so that in every copy of $H$ some color occurs an odd number of times, and the unique-Ramsey number $r_{\text{u}}(n,H)$ is the corresponding notion in which some color is required to occur not only an odd number of times but exactly once.
In this paper, we address three questions from previous papers. We show $r_{\text{odd}}(n,K_{s,t})> n^{1/\left(\frac s2+\frac 1{2\lfloor t/8 \rfloor}\right)}$ when $s\leq t$ and $s$ is odd and $t$ is even, which is log-asymptotically tight when $s$ is fixed and $t\to\infty$. Next, we consider the odd-Ramsey number when the host graph to be edge-colored is a super-Dirac graph, and show that in any host graph with minimum degree at least $n/2+2$, the odd-Ramsey number of Hamilton cycles is non-trivial. Finally, we show that $r_\text{u}(n,C_n)> n/4$, which leads to a polynomial gap between $r_\text{odd}(n,C_n)$ and $r_\text{u}(n,C_n)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_07322 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | New results on the odd- and unique-Ramsey numbers Das, Shagnik Wu, Ying-Sian Combinatorics 05C55 The odd-Ramsey number $r_{\text{odd}}(n,H)$ of a graph $H$ is the minimum number of colors needed to edge-color $K_n$ so that in every copy of $H$ some color occurs an odd number of times, and the unique-Ramsey number $r_{\text{u}}(n,H)$ is the corresponding notion in which some color is required to occur not only an odd number of times but exactly once. In this paper, we address three questions from previous papers. We show $r_{\text{odd}}(n,K_{s,t})> n^{1/\left(\frac s2+\frac 1{2\lfloor t/8 \rfloor}\right)}$ when $s\leq t$ and $s$ is odd and $t$ is even, which is log-asymptotically tight when $s$ is fixed and $t\to\infty$. Next, we consider the odd-Ramsey number when the host graph to be edge-colored is a super-Dirac graph, and show that in any host graph with minimum degree at least $n/2+2$, the odd-Ramsey number of Hamilton cycles is non-trivial. Finally, we show that $r_\text{u}(n,C_n)> n/4$, which leads to a polynomial gap between $r_\text{odd}(n,C_n)$ and $r_\text{u}(n,C_n)$. |
| title | New results on the odd- and unique-Ramsey numbers |
| topic | Combinatorics 05C55 |
| url | https://arxiv.org/abs/2605.07322 |