A Note on Directed 5-Cycles in Digraphs

摘要

In this note, it is proved that if α≥0.24817, then any digraph on n vertices with minimum outdegree at least αn contains a directed cycle of length at most 5.