An exact minimum degree condition for Hamilton cycles in oriented graphs

被引：32
|
作者：
Keevash, Peter [1 ]
Kuehn, Daniela [2 ]
Osthus, Deryk [2 ]
机构：
[1] Univ London, Sch Math Sci, London E1 4NS, England
[2] Univ Birmingham, Sch Math, Birmingham B15 2TT, W Midlands, England
来源：
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES | 2009年 / 79卷
基金：
英国工程与自然科学研究理事会;
关键词：
BLOW-UP LEMMA; CONJECTURE; ELDRIDGE; BOLLOBAS;
D O I：
10.1112/jlms/jdn065
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We show that every sufficiently large oriented graph G with delta(+)(G), delta(-)(G) >= (3n - 4)/8 contains a Hamilton cycle. This is best possible and solves a problem of Thomassen from 1979.
引用
收藏
页码：144 / 166
页数：23
相关论文
共 50 条
  • [1] Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree
    Kuehn, Daniela
    Lapinskas, John
    Osthus, Deryk
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2013, 22 (03): : 394 - 416
  • [2] A note on minimum degree condition for Hamilton (a, b)-cycles in hypergraphs
    Wang, Jian
    [J]. DISCRETE MATHEMATICS, 2023, 346 (01)
  • [3] Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis
    Anastos, Michael
    Frieze, Alan
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2020, 57 (04) : 865 - 878
  • [4] Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k
    [J]. 2000, Wiley-Liss Inc. (34)
  • [5] Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k
    Bollobás, B
    Cooper, C
    Fenner, TI
    Frieze, AM
    [J]. JOURNAL OF GRAPH THEORY, 2000, 34 (01) : 42 - 59
  • [6] Minimum degree conditions for tight Hamilton cycles
    Lang, Richard
    Sanhueza-Matamala, Nicolas
    [J]. JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2022, 105 (04): : 2249 - 2323
  • [7] Hamilton Cycles, Minimum Degree, and Bipartite Holes
    McDiarmid, Colin
    Yolov, Nikola
    [J]. JOURNAL OF GRAPH THEORY, 2017, 86 (03) : 277 - 285
  • [8] On the Number of Hamilton Cycles in Bounded Degree Graphs
    Gebauer, Heidi
    [J]. PROCEEDINGS OF THE TENTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE FIFTH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2008, : 241 - 248
  • [9] Arbitrary Orientations of Hamilton Cycles in Oriented Graphs
    Kelly, Luke
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [10] A SEMIEXACT DEGREE CONDITION FOR HAMILTON CYCLES IN DIGRAPHS
    Christofides, Demetres
    Keevash, Peter
    Kuehn, Daniela
    Osthus, Deryk
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (03) : 709 - 756
12345