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 条
  • [21] A minimum degree result for disjoint cycles and forests in graphs
    Schuster, GW
    [J]. COMBINATORICA, 1998, 18 (03) : 425 - 436
  • [22] A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
    Kelly, Luke
    Kuehn, Daniela
    Osthust, Deryk
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2008, 17 (05): : 689 - 709
  • [23] An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
    Frieze, Alan
    Haber, Simi
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (01) : 73 - 98
  • [24] A degree sum condition for graphs to be covered by two cycles
    Chiba, Shuya
    Tsugaki, Masao
    [J]. DISCRETE MATHEMATICS, 2010, 310 (13-14) : 1864 - 1874
  • [25] Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs
    Condon, Padraig
    Diaz, Alberto Espuny
    Kuhn, Daniela
    Osthus, Deryk
    Kim, Jaehoon
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (04):
  • [26] EDGE-DISJOINT HAMILTON CYCLES IN REGULAR GRAPHS OF LARGE DEGREE
    JACKSON, B
    [J]. JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1979, 19 (FEB): : 13 - 16
  • [27] Paths and cycles in random subgraphs of graphs with large minimum degree
    Ehard, Stefan
    Joos, Felix
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (02):
  • [28] Long Cycles in Random Subgraphs of Graphs with Large Minimum Degree
    Riordan, Oliver
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2014, 45 (04) : 762 - 765
  • [29] Minimum Degree and Disjoint Cycles in Claw-Free Graphs
    Faudree, Ralph J.
    Gould, Ronald J.
    Jacobson, Michael S.
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2012, 21 (1-2): : 129 - 139
  • [30] Decomposing Graphs of High Minimum Degree into 4-Cycles
    Bryant, Darryn
    Cavenagh, Nicholas J.
    [J]. JOURNAL OF GRAPH THEORY, 2015, 79 (03) : 167 - 177
12345