Girth in digraphs

Abstract

Abstract For an integer k > 2, the best function m ( n, k ) is determined such that every strong digraph of order n with at least m ( n, k ) arcs contains a circuit of length k or less.