An exact minimum degree condition for Hamilton cycles in oriented graphs
From MaRDI portal
Publication:3600872
DOI10.1112/jlms/jdn065zbMath1198.05081arXiv0801.0394MaRDI 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
05C35: Extremal problems in graph theory
05C20: Directed graphs (digraphs), tournaments
05C45: Eulerian and Hamiltonian graphs
Related Items
An approximate version of Jackson’s conjecture, An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs, Pósa's conjecture for graphs of order at least 2 × 108, Unnamed Item, Path decompositions of tournaments, Antipaths in oriented graphs, Counting and packing Hamilton cycles in dense graphs and oriented graphs, On directed versions of the Corrádi-Hajnal corollary, A survey on Hamilton cycles in directed graphs, 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, Hamilton cycles in sparse robustly expanding digraphs, Tight bounds for powers of Hamilton cycles in tournaments, Spanning trees of dense directed graphs, Hamilton decompositions of regular expanders: applications, Degree sequences forcing Hamilton cycles in directed graphs, Short cycles in oriented graphs, A note on some embedding problems for oriented graphs, Arbitrary Orientations of Hamilton Cycles in Digraphs, A hypergraph blow-up lemma, Tournaments and Semicomplete Digraphs