Arbitrary orientations of Hamilton cycles in oriented graphs
From MaRDI portal
(Redirected from Publication:640446)
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
(18)- Antipaths in oriented graphs
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
- Antidirected subgraphs of oriented graphs
- Orientations of Hamiltonian cycles in bipartite digraphs
- Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs
- On ordered graphs and graph orderings
- An oriented discrepancy version of Dirac's theorem
- A survey on Hamilton cycles in directed graphs
- A density result for random sparse oriented graphs and its relation to a conjecture of Woodall
- Hamiltonian numbers in oriented graphs
- Hamilton cycles in sparse robustly expanding digraphs
- Quasirandom-Forcing Orientations of Cycles
- A note on some embedding problems for oriented graphs
- Orientation Ramsey thresholds for cycles and cliques
- Arbitrary orientations of Hamilton cycles in digraphs
- Oriented hamilton cycles in digraphs
- Orientations of hamiltonian cycles in large digraphs
- Oriented discrepancy of Hamilton cycles
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)