Short Cycles in Digraphs with Local Average Outdegree at Least Two

Suppose G is a strongly connected digraph with order n girth g and diameter d. We prove that d + g n if G contains no arcs (u; v) with deg (u) = 1 and (v) 2