当前位置:
X-MOL 学术
›
Comb. Probab. Comput.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles
Combinatorics, Probability and Computing ( IF 0.9 ) Pub Date : 2021-03-09 , DOI: 10.1017/s0963548320000243 G. R. Omidi
Combinatorics, Probability and Computing ( IF 0.9 ) Pub Date : 2021-03-09 , DOI: 10.1017/s0963548320000243 G. R. Omidi
It has been conjectured that, for any fixed \[{\text{r}} \geqslant 2\] and sufficiently large n , there is a monochromatic Hamiltonian Berge-cycle in every \[({\text{r}} - 1)\] -colouring of the edges of \[{\text{K}}_{\text{n}}^{\text{r}}\] , the complete r -uniform hypergraph on n vertices. In this paper we prove this conjecture.
中文翻译:
Gyárfás、Lehel、Sárközy 和 Schhelp 关于 Berge 循环的猜想的证明
据推测,对于任何固定的\[{\text{r}} \geqslant 2\] 并且足够大n ,在每个单色哈密顿伯杰循环\[({\text{r}} - 1)\] - 边缘的着色\[{\text{K}}_{\text{n}}^{\text{r}}\] , 完整的r -一致的超图n 顶点。在本文中,我们证明了这个猜想。
更新日期:2021-03-09
中文翻译:
Gyárfás、Lehel、Sárközy 和 Schhelp 关于 Berge 循环的猜想的证明
据推测,对于任何固定的