当前位置:
X-MOL 学术
›
J. Comb. Theory B
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs
Journal of Combinatorial Theory Series B ( IF 1.4 ) Pub Date : 2021-12-08 , DOI: 10.1016/j.jctb.2021.11.003 Hiệp Hàn , Jie Han , Yi Zhao
中文翻译:
k-均匀超图中Hamilton (k/2)-cycles的最小度阈值
更新日期:2021-12-08
Journal of Combinatorial Theory Series B ( IF 1.4 ) Pub Date : 2021-12-08 , DOI: 10.1016/j.jctb.2021.11.003 Hiệp Hàn , Jie Han , Yi Zhao
For any even integer , integer d such that , and sufficiently large , we find a tight minimum d-degree condition that guarantees the existence of a Hamilton -cycle in every k-uniform hypergraph on n vertices. When , the degree condition coincides with the one for the existence of perfect matchings provided by Rödl, Ruciński and Szemerédi (for ) and Treglown and Zhao (for ), and thus our result strengthens theirs in this case.
中文翻译:
k-均匀超图中Hamilton (k/2)-cycles的最小度阈值
对于任何偶数 , 整数d使得,并且足够大 ,我们找到了一个严格的最小d度条件,保证了哈密顿的存在-循环在n个顶点上的每个k -均匀超图中。什么时候,度条件与 Rödl、Ruciński 和 Szemerédi 提供的存在完美匹配的条件一致(对于 ) 和 Treglown 和 Zhao (对于 ),因此我们的结果在这种情况下加强了他们的结果。