Loose Hamilton Cycles in Random Uniform Hypergraphs

被引:0
|
作者
Dudek, Andrzej [1 ]
Frieze, Alan [1 ]
机构
[1] Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA
来源
ELECTRONIC JOURNAL OF COMBINATORICS | 2011年 / 18卷 / 01期
基金
美国国家科学基金会;
关键词
RANDOM REGULAR GRAPHS;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In the random k-uniform hypergraph H(n,p;k) 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 adjacent edges intersects in a single vertex. We prove that if pn(k-1)/log n tends to infinity with n then lim Pr(H(n,p;k) contains a loose Hamilton cycle) = 1. n ->infinity 2(k-1)vertical bar n This is asymptotically best possible.
引用
收藏
页数:14
相关论文
共 50 条
  • [1] Loose Hamilton Cycles in Random 3-Uniform Hypergraphs
    Frieze, Alan
    ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
  • [2] Transference for loose Hamilton cycles in random 3-uniform hypergraphs
    Petrova, Kalina
    Trujic, Milos
    RANDOM STRUCTURES & ALGORITHMS, 2024, 65 (02) : 313 - 341
  • [3] Tight Hamilton cycles in random uniform hypergraphs
    Dudek, Andrzej
    Frieze, Alan
    RANDOM STRUCTURES & ALGORITHMS, 2013, 42 (03) : 374 - 385
  • [4] Loose Hamilton cycles in hypergraphs
    Keevash, Peter
    Kuehn, Daniela
    Mycroft, Richard
    Osthus, Deryk
    DISCRETE MATHEMATICS, 2011, 311 (07) : 544 - 559
  • [5] Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
    Dudek, Andrzej
    Frieze, Alan
    Loh, Po-Shen
    Speiss, Shelley
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (04):
  • [6] Dirac-type results for loose Hamilton cycles in uniform hypergraphs
    Han, Hiep
    Schacht, Mathias
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2010, 100 (03) : 332 - 346
  • [7] Loose Hamilton Cycles in Regular Hypergraphs
    Dudek, Andrzej
    Frieze, Alan
    Rucinski, Andrzej
    Sileikis, Matas
    COMBINATORICS PROBABILITY & COMPUTING, 2015, 24 (01): : 179 - 194
  • [8] Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
    Han, Hiep
    Han, Jie
    Morris, Patrick
    RANDOM STRUCTURES & ALGORITHMS, 2022, 61 (01) : 101 - 125
  • [9] Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
    Han, Hiep
    Han, Jie
    Morris, Patrick
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 702 - 717
  • [10] Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
    Han, Hiep
    Han, Jie
    Morris, Patrick
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 702 - 717