Short cycles in digraphs (Q1112060)

The main result of this paper is: If G is a digraph with n vertices such that each vertex of G has outdegree at least k (k\(\geq 2)\), then G has a cycle of length at most \((n/k)+304.\) This theorem is an improvement of the result of \textit{V. Chvátal} and \textit{E. Szemerédi} [J. Comb. Theory, Ser. B 35, 323-327 (1983; Zbl 0545.05038)] in which 304 is replaced by 2500.