A Dirac type result on Hamilton cycles in oriented graphs
Abstract
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. 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\"aggkvist. We also prove an Ore-type theorem for oriented graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.