Tight Hamilton cycles in random uniform hypergraphs
Tight Hamilton cycles in random uniform hypergraphs
复制标题
随机均匀超图中的紧哈密顿循环
DOI：
10.1002/rsa.20404
复制
发表时间：
2011
影响因子：
1
通讯作者：
A. Frieze
中科院分区：
文献类型：
--
作者：
A. Dudek;A. Frieze
在本文中，我们证明了e/n是随机k-一致超图中存在紧汉密尔顿圈的临界值，对于所有k ≥ 4。当k = 3时，我们证明了1/n是一个渐近阈值。我们还确定了其他类型的汉密尔顿周期的存在的阈值。© 2012 Wiley Periodicals，Inc.随机结构算法，2013
In this paper we show that e/n is the sharp threshold for the existence of tight Hamilton cycles in random k ‐uniform hypergraphs, for all k ≥ 4. When k = 3 we show that 1/n is an asymptotic threshold. We also determine thresholds for the existence of other types of Hamilton cycles. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013