Arbitrary Orientations of Hamilton Cycles in Digraphs

DOI10.1137/140974675zbMath1320.05049arXiv1408.1812OpenAlexW2963578855MaRDI QIDQ2944460

Amelia Taylor, Deryk Osthus, Louis DeBiasio, Theodore Molla, Daniela Kühn

Publication date: 2 September 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

digraphsextremal problemsHamilton cyclesrobust expanders

Mathematics Subject Classification ID

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

Related Items (3)

Spanning trees of dense directed graphs ⋮ Spanning trees in dense directed graphs ⋮ Packing and counting arbitrary Hamilton cycles in random digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on Hamilton cycles in directed graphs
• Arbitrary orientations of Hamilton cycles in oriented graphs
• Semi-degree threshold for anti-directed Hamiltonian cycles
• A counterexample to a conjecture of Grant
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• On Hamiltonian bipartite graphs
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• Paths and Cycles in Tournaments
• Oriented hamilton cycles in digraphs
• Some Theorems on Abstract Graphs

This page was built for publication: Arbitrary Orientations of Hamilton Cycles in Digraphs