On extremal hypergraphs for Hamiltonian cycles

被引：30
|
作者：
Glebov, Roman [1 ]
Person, Yury [1 ]
Weps, Wilma [1 ]
机构：
[1] Free Univ Berlin, Inst Math, D-14195 Berlin, Germany
来源：
EUROPEAN JOURNAL OF COMBINATORICS | 2012年 / 33卷 / 04期
关键词：
DIRAC-TYPE THEOREM; PERFECT MATCHINGS; UNIFORM HYPERGRAPHS;
D O I：
10.1016/j.ejc.2011.10.003
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Turan- and Dirac-type results. While the Turan-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph depending only on the extremal number of a certain path, the Dirac-type result yields a sufficient condition relying solely on the minimum vertex degree. (C) 2011 Elsevier Ltd. All rights reserved.
引用
下载
收藏
页码：544 / 555
页数：12
相关论文
共 50 条
  • [21] Extremal problems for geometric hypergraphs
    Dey, TK
    Pach, J
    ALGORITHMS AND COMPUTATION, 1996, 1178 : 105 - 114
  • [22] Extremal Problems for Geometric Hypergraphs
    T. K. Dey
    J. Pach
    Discrete & Computational Geometry, 1998, 19 : 473 - 484
  • [23] Odd cycles and Θ-cycles in hypergraphs
    Gyarfas, Andras
    Jacobson, Michael S.
    Kezdy, Andre E.
    Lehel, Jeno
    DISCRETE MATHEMATICS, 2006, 306 (19-20) : 2481 - 2491
  • [24] SPECTRAL EXTREMAL PROBLEMS FOR HYPERGRAPHS
    Keevash, Peter
    Lenz, John
    Mubayi, Dhruv
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (04) : 1838 - 1854
  • [25] EXTREMAL PROBLEM FOR GRAPHS AND HYPERGRAPHS
    STERBOUL, F
    DISCRETE MATHEMATICS, 1975, 11 (01) : 71 - 78
  • [26] Extremal problems for geometric hypergraphs
    Dey, TK
    Pach, J
    DISCRETE & COMPUTATIONAL GEOMETRY, 1998, 19 (04) : 473 - 484
  • [27] Hamiltonian chains in hypergraphs
    Katona, GY
    Kierstead, HA
    JOURNAL OF GRAPH THEORY, 1999, 30 (03) : 205 - 212
  • [28] MINIMUM PAIR-DEGREE FOR TIGHT HAMILTONIAN CYCLES IN 4-UNIFORM HYPERGRAPHS
    Reiher, C.
    Rodl, V.
    Rucinski, A.
    Schacht, M.
    Schuelke, B.
    ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2019, 88 (03): : 1023 - 1027
  • [29] Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs
    Roedl, Vojtech
    Rucinski, Andrzej
    Szemeredi, Endre
    ADVANCES IN MATHEMATICS, 2011, 227 (03) : 1225 - 1299
  • [30] Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs
    Reiher, Christian
    Rodl, Vojtech
    Rucinski, Andrzej
    Schacht, Mathias
    Szemeredi, Endre
    PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2019, 119 (02) : 409 - 439
12345