A note on directed 4-cycles in digraphs

Abstract

Using some combinatorial techniques, in this note, it is proved that if $\alpha \ge 0.28866$, then any digraph on $n$ vertices with minimum outdegree at least $\alpha n$ contains a directed cycle of length at most 4.