论文标题

紧密的哈密顿周期的最低配对度条件为$ 4 $均匀的超图

Minimum pair degree condition for tight Hamiltonian cycles in $4$-uniform hypergraphs

论文作者

Polcyn, Joanna, Reiher, Christian, Rödl, Vojtěch, Ruciński, Andrzej, Schacht, Mathias, Schülke, Bjarne

论文摘要

我们表明,每4均匀的超图和$ n $顶点和最低成对度至少$(5/9+O(1))n^2/2 $包含一个紧密的汉密尔顿周期。该度条件在渐近上是最佳的。

We show that every 4-uniform hypergraph with $n$ vertices and minimum pair degree at least $(5/9+o(1))n^2/2$ contains a tight Hamiltonian cycle. This degree condition is asymptotically optimal.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源