Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs

[摘要] In the random $k$-uniform hypergraph $H^{(k)}_{n,p}$ of order $n$, each possible $k$-tuple appears independently with probability $p$. A loose Hamilton cycle is a cycle of order $n$ in which every pair of consecutive edges intersects in a single vertex. I

[学科分类] 离散数学和组合数学

[关键词] loose Hamilton cycles;random uniform hypergraphs