Mathematics – Combinatorics
Scientific paper
2007-09-07
Mathematics
Combinatorics
Added an Ore-type result
Scientific paper
We show that for each \alpha>0 every sufficiently large oriented graph G with \delta^+(G),\delta^-(G)\ge 3|G|/8+ \alpha |G| contains a Hamilton cycle. This gives an approximate solution to a problem of Thomassen. In fact, we prove the stronger result that G is still Hamiltonian if \delta(G)+\delta^+(G)+\delta^-(G)\geq 3|G|/2 + \alpha |G|. Up to the term \alpha |G| this confirms a conjecture of H\"aggkvist. We also prove an Ore-type theorem for oriented graphs.
Kelly Luke
Kühn Daniela
Osthus Deryk
No associations
LandOfFree
A Dirac type result on Hamilton cycles in oriented graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Dirac type result on Hamilton cycles in oriented graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Dirac type result on Hamilton cycles in oriented graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-467189