Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Ramsey numbers of $5$-uniform loose cycles (1806.07720v1)

Published 14 Jun 2018 in math.CO

Abstract: Gy\'{a}rf\'{a}s et al. determined the asymptotic value of the diagonal Ramsey number of $\mathcal{C}k_n$, $R(\mathcal{C}k_n,\mathcal{C}k_n),$ generating the same result for $k=3$ due to Haxell et al. Recently, the exact values of the Ramsey numbers of 3-uniform loose paths and cycles are completely determined. These results are motivations to conjecture that for every $n\geq m\geq 3$ and $k\geq 3,$ $$R(\mathcal{C}k_n,\mathcal{C}k_m)=(k-1)n+\lfloor\frac{m-1}{2}\rfloor,$$ as mentioned by Omidi et al. More recently, it is shown that this conjecture is true for $n=m\geq 2$ and $k\geq 7$ and for $k=4$ when $n>m$ or $n=m$ is odd. Here we investigate this conjecture for $k=5$ and demonstrate that it holds for $k=5$ and sufficiently large $n$.

Summary

We haven't generated a summary for this paper yet.