首页 | 本学科首页   官方微博 | 高级检索  
     


Tight Hamilton cycles in random uniform hypergraphs
Authors:Andrzej Dudek  Alan Frieze
Affiliation:1. Department of Mathematics, Western Michigan University, Kalamazoo, Michigan 49008;2. Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
Abstract: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
Keywords:Hamiltonicity  random hypergraphs
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号