加载中…
Gy'{a}rf'{a}s et al. determined the asymptotic value of the diagonal Ramsey number of , generating the same result for 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 3k\geq 3,$ as mentioned by Omidi et al. More recently, it is shown that this conjecture is true for and and for when or is odd. Here we investigate this conjecture for and demonstrate that it holds for and sufficiently large .

生成讲解博客的中文版本

生成AI智能校验的中文版本