A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
复制标题
DOI：
10.1017/s0963548308009218
复制
发表时间：
2007-09
期刊：
影响因子：
--
通讯作者：
Luke Kelly;D. Kühn;Deryk Osthus
中科院分区：
文献类型：
--
作者：
Luke Kelly;D. Kühn;Deryk Osthus
我们表明，对于每个α> 0，每个δ+（g），δ-（g）≥3| g |/8+α| g | | Thomassen的问题[21]。直到α| g |一词，这证实了häggkvist的概念[10]。定理用于方向图。
We show that for each α>0 every sufficiently large oriented graph G with δ+(G), δ−(G)≥3|G|/8+α|G| contains a Hamilton cycle. This gives an approximate solution to a problem of Thomassen [21]. In fact, we prove the stronger result that G is still Hamiltonian if δ(G)+δ+(G)+δ−(G)≥3|G|/2 + α|G|. Up to the term α|G|, this confirms a conjecture of Häggkvist [10]. We also prove an Ore-type theorem for oriented graphs.