An exact minimum degree condition for Hamilton cycles in oriented graphs

DOI10.1112/jlms/jdn065zbMath1198.05081arXiv0801.0394OpenAlexW3100779871MaRDI QIDQ3600872

Peter Keevash, Daniela Kühn, Deryk Osthus

Publication date: 6 February 2009

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (24)

A note on some embedding problems for oriented graphs ⋮ Spanning trees of dense directed graphs ⋮ Counting and packing Hamilton cycles in dense graphs and oriented graphs ⋮ Hamilton cycles in sparse robustly expanding digraphs ⋮ Arbitrary Orientations of Hamilton Cycles in Digraphs ⋮ On directed versions of the Corrádi-Hajnal corollary ⋮ Path decompositions of tournaments ⋮ Antipaths in oriented graphs ⋮ A survey on Hamilton cycles in directed graphs ⋮ Hamilton cycles in dense regular digraphs and oriented graphs ⋮ An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs ⋮ Hamilton decompositions of regular expanders: applications ⋮ Unnamed Item ⋮ An approximate version of Sumner's universal tournament conjecture ⋮ Pósa's conjecture for graphs of order at least 2 × 10⁸ ⋮ Cycles of given length in oriented graphs ⋮ Hamiltonian degree sequences in digraphs ⋮ A hypergraph blow-up lemma ⋮ Triangle packings and 1-factors in oriented graphs ⋮ An approximate version of Jackson’s conjecture ⋮ Tournaments and Semicomplete Digraphs ⋮ Degree sequences forcing Hamilton cycles in directed graphs ⋮ Short cycles in oriented graphs ⋮ Tight bounds for powers of Hamilton cycles in tournaments

This page was built for publication: An exact minimum degree condition for Hamilton cycles in oriented graphs