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