On the threshold Ramsey multiplicity conjectures for paths and even cycles
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913179145076736 |
|---|---|
| author | Huang, Ting Yang, Jiabao Chen, Yaojun |
| author_facet | Huang, Ting Yang, Jiabao Chen, Yaojun |
| contents | The Ramsey number $r(H)$ of a graph $H$ is the minimum positive integer $n$ such that every red/blue edge-coloring of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $H$. The threshold Ramsey multiplicity $m(H)$ of $H$ is the minimum number of monochromatic copies of $H$ over all red/blue edge-colorings of $K_{r(H)}$. Let $P_t$ and $C_t$ be a path and a cycle on $t$ vertices, respectively. In this paper, by using combinatorial and local random construction, we show that $$m(C_{2t})\le t^{-γ+o(1)}\frac{(2t-1)!}{2}, \qquad m(P_{2t+1})\le t^{-γ+o(1)}\frac{t}{2}(2t)!,$$ and $$m(P_{2t})\leq \left(\frac{7}{8}+o(1)\right)\frac{(2t)!}{2},$$ for sufficiently large $t$, where $γ=1/(1+\sqrt{2})$. These results disprove two conjectures on the threshold Ramsey multiplicity for even cycles and paths, due to Conlon, Fox, Sudakov, and Wei. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2606_01996 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On the threshold Ramsey multiplicity conjectures for paths and even cycles Huang, Ting Yang, Jiabao Chen, Yaojun Combinatorics 05C38, 05C80, 05D10 The Ramsey number $r(H)$ of a graph $H$ is the minimum positive integer $n$ such that every red/blue edge-coloring of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $H$. The threshold Ramsey multiplicity $m(H)$ of $H$ is the minimum number of monochromatic copies of $H$ over all red/blue edge-colorings of $K_{r(H)}$. Let $P_t$ and $C_t$ be a path and a cycle on $t$ vertices, respectively. In this paper, by using combinatorial and local random construction, we show that $$m(C_{2t})\le t^{-γ+o(1)}\frac{(2t-1)!}{2}, \qquad m(P_{2t+1})\le t^{-γ+o(1)}\frac{t}{2}(2t)!,$$ and $$m(P_{2t})\leq \left(\frac{7}{8}+o(1)\right)\frac{(2t)!}{2},$$ for sufficiently large $t$, where $γ=1/(1+\sqrt{2})$. These results disprove two conjectures on the threshold Ramsey multiplicity for even cycles and paths, due to Conlon, Fox, Sudakov, and Wei. |
| title | On the threshold Ramsey multiplicity conjectures for paths and even cycles |
| topic | Combinatorics 05C38, 05C80, 05D10 |
| url | https://arxiv.org/abs/2606.01996 |