Loose Hamilton cycles in hypergraphs

被引:40
|
作者
Keevash, Peter [1 ]
Kuehn, Daniela [2 ]
Mycroft, Richard [1 ]
Osthus, Deryk [2 ]
机构
[1] Univ London, Sch Math Sci, London E1 4NS, England
[2] Univ Birmingham, Sch Math, Birmingham B15 2TT, W Midlands, England
基金
英国工程与自然科学研究理事会;
关键词
Hamilton cycle; Hypergraph; Hypergraph regularity; Blow-up lemma; K-UNIFORM HYPERGRAPHS; DIRAC-TYPE THEOREM; 3-UNIFORM HYPERGRAPHS; REGULAR PARTITIONS; LEMMAS;
D O I
10.1016/j.disc.2010.11.013
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We prove that any k-uniform hypergraph on n vertices with minimum degree at least n/2(k-1) + o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by Kuhn and Osthus for the 3-uniform case. Though some additional difficulties arise in the k-uniform case, our argument here is considerably simplified by applying the recent hypergraph blow-up lemma of Keevash. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:544 / 559
页数:16
相关论文
共 50 条
  • [1] Loose Hamilton Cycles in Regular Hypergraphs
    Dudek, Andrzej
    Frieze, Alan
    Rucinski, Andrzej
    Sileikis, Matas
    COMBINATORICS PROBABILITY & COMPUTING, 2015, 24 (01): : 179 - 194
  • [2] Loose Hamilton Cycles in Random Uniform Hypergraphs
    Dudek, Andrzej
    Frieze, Alan
    ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [3] 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):
  • [4] Loose Hamilton Cycles in Random 3-Uniform Hypergraphs
    Frieze, Alan
    ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
  • [5] Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
    Han, Hiep
    Han, Jie
    Morris, Patrick
    RANDOM STRUCTURES & ALGORITHMS, 2022, 61 (01) : 101 - 125
  • [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] Transference for loose Hamilton cycles in random 3-uniform hypergraphs
    Petrova, Kalina
    Trujic, Milos
    RANDOM STRUCTURES & ALGORITHMS, 2024, 65 (02) : 313 - 341
  • [8] 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
  • [9] 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
  • [10] Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
    Kuhn, Daniela
    Osthus, Deryk
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2006, 96 (06) : 767 - 821