A Dirac-Type Result on Hamilton Cycles in Oriented Graphs

DOI10.1017/S0963548308009218zbMath1172.05038arXiv0709.1047OpenAlexW2138256399MaRDI QIDQ3529511

Deryk Osthus, Daniela Kühn, Luke J. Kelly

Publication date: 13 October 2008

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0709.1047

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (11)

Hamilton cycles in sparse robustly expanding digraphs ⋮ Antipaths in oriented graphs ⋮ A survey on Hamilton cycles in directed graphs ⋮ Hamilton decompositions of regular expanders: applications ⋮ Unnamed Item ⋮ An approximate version of Sumner's universal tournament conjecture ⋮ Cycles of given length in oriented graphs ⋮ Hamiltonian degree sequences in digraphs ⋮ Triangle packings and 1-factors in oriented graphs ⋮ Short cycles in oriented graphs ⋮ Tight bounds for powers of Hamilton cycles in tournaments

Cites Work

• The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
• Powers of Hamilton cycles in tournaments
• Blow-up lemma
• On packing Hamilton cycles in \(\varepsilon\)-regular graphs
• Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
• Note on Hamilton Circuits
• Long Cycles in Digraphs
• Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
• The Blow-up Lemma
• On the Bollobás–Eldridge Conjecture for Bipartite Graphs
• Sufficient Conditions for Circuits in Graphs^†
• Testing subgraphs in directed graphs

This page was built for publication: A Dirac-Type Result on Hamilton Cycles in Oriented Graphs