Arbitrary orientations of Hamilton cycles in oriented graphs
From MaRDI portal
Abstract: We use a randomised embedding method to prove that for all alpha>0 any sufficiently large oriented graph G with minimum in-degree and out-degree delta^+(G),delta^-(G)geq (3/8+alpha)|G| contains every possible orientation of a Hamilton cycle. This confirms a conjecture of H"aggkvist and Thomason.
Recommendations
Cited in
(23)- On ordered graphs and graph orderings
- Orientations of Hamiltonian cycles in bipartite digraphs
- Hamilton cycles in sparse robustly expanding digraphs
- Hamiltonian numbers in oriented graphs
- A density result for random sparse oriented graphs and its relation to a conjecture of Woodall
- Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs
- A note on some embedding problems for oriented graphs
- Arbitrary orientations of Hamilton cycles in digraphs
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
- Orientations of hamiltonian cycles in large digraphs
- A survey on Hamilton cycles in directed graphs
- Hamilton Cycles in Oriented Graphs
- scientific article; zbMATH DE number 1047732 (Why is no real title available?)
- Oriented hamilton cycles in digraphs
- Orientation Ramsey thresholds for cycles and cliques
- Oriented discrepancy of Hamilton cycles
- Quasirandom-Forcing Orientations of Cycles
- Antipaths in oriented graphs
- An oriented discrepancy version of Dirac's theorem
- Antidirected subgraphs of oriented graphs
- Paths with two blocks in oriented graphs of large minimum semi-degree
- Alternating paths in oriented graphs with large semidegree
- Long antipaths and anticycles in oriented graphs
This page was built for publication: Arbitrary orientations of Hamilton cycles in oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640446)