Journal of Combinatorial Theory, Series BVolume 35, Issue 3, December 1983, Pages 323-327NoteShort cycles in directed graphsAuthor links open overlay panelV Chvátal, E SzemerédiShow moreShareCitehttps://doi.org/10.1016/0095-8956(83)90059-XGet rights and contentUnder an Elsevier user licenseopen archiveAbstractIt is proved that every directed graph with n vertices and minimum outdegree k contains a directed cycle of length at most nk + 2500.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1983 Published by Elsevier Inc.