Short cycles in directed graphs
From MaRDI portal
The authors prove, by an inductive argument, that every directed graph with n vertices and minimum outdegree k contains a directed cycle of length at most \(n/K+2500.\)
Cites work
Cited in
(19)- Short cycles in digraphs
- Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
- Some approaches to a conjecture on short cycles in digraphs
- Minimum order of loop networks of given degree and girth
- Total domination and the Caccetta-Häggkvist conjecture
- Simulating laser-fluid coupling and laser-induced cavitation using embedded boundary and level set methods
- Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
- On the co-degree threshold for the Fano plane
- Short cycles in oriented graphs
- On the Caccetta-Häggkvist conjecture with forbidden subgraphs
- On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament
- A note on short cycles in digraphs
- Rainbow cycles for families of matchings
- Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture
- Degree conditions forcing oriented cycles
- On the length of directed paths in digraphs
- Short rainbow cycles for families of matchings and triangles
- Subgraphs with a positive minimum semidegree in digraphs with large outdegree
- Cycles of given length in oriented graphs
This page was built for publication: Short cycles in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797594)
