Short cycles in directed graphs
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.\)
scientific article; zbMATH DE number 3867367