scientific article; zbMATH DE number 1047732
From MaRDI portal
Publication:4347899
It is shown that for every \(\varepsilon >0\), if each vertex of an \(n\)-vertex digraph has indegree and outdegree at least \((5/12 +\varepsilon)n\) and \(n>n_0 (\varepsilon)\) is sufficiently large, the digraph contains \(n\)-cycles of every orientation. For the entire collection see [Zbl 0865.00038].
Recommendations
Cited in
(27)- Triangle packings and 1-factors in oriented graphs
- Mutiplicativity of oriented cycles
- Orientations of Hamiltonian cycles in bipartite digraphs
- Hamiltonian numbers in oriented graphs
- Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs
- Vertex-oriented Hamilton cycles in directed graphs
- Arbitrary orientations of Hamilton cycles in digraphs
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
- An exact minimum degree condition for 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
- Oriented hamilton cycles in digraphs
- Orientations making \(k\)-cycles cyclic
- Oriented discrepancy of Hamilton cycles
- Antipaths in oriented graphs
- Arbitrary orientations of Hamilton cycles in oriented graphs
- Cycle-factors in oriented graphs
- On oriented cycles in randomly perturbed digraphs
- Paths with two blocks in oriented graphs of large minimum semi-degree
- Alternating paths in oriented graphs with large semidegree
- Embedding cycles of given length in oriented graphs
- Long antipaths and anticycles in oriented graphs
- Anti-directed cycle-factors in oriented graphs
- Cycles in oriented 3-graphs
- Semi-degree threshold for anti-directed Hamiltonian cycles
- Cycles of given length in oriented graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347899)
