Arbitrary orientations of Hamilton cycles in oriented graphs
From MaRDI portal
Publication:640446
zbMATH Open1236.05120arXiv0907.3358MaRDI QIDQ640446FDOQ640446
Publication date: 18 October 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0907.3358
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40)
Cited In (14)
- A density result for random sparse oriented graphs and its relation to a conjecture of Woodall
- Arbitrary Orientations of Hamilton Cycles in Digraphs
- Orientations of hamiltonian cycles in large digraphs
- Quasirandom-Forcing Orientations of Cycles
- Oriented discrepancy of Hamilton cycles
- On ordered graphs and graph orderings
- A survey on Hamilton cycles in directed graphs
- Antidirected subgraphs of oriented graphs
- Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs
- Hamilton cycles in sparse robustly expanding digraphs
- Orientations of Hamiltonian cycles in bipartite digraphs
- Hamiltonian numbers in oriented graphs
- Antipaths in oriented graphs
- Oriented hamilton cycles in digraphs
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)
