Abstract
A digraph is called k-cyclic if it cannot be made acyclic by removing less than k arcs. It is proved that for every e > 0 there are constants K and δ so that for every d ∈ (0, δn), every e n2-cyclic digraph with n vertices contains a directed cycle whose length is between d and d + K. A more general result of the same form is obtained for blow-ups of directed cycles.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
