Prefer a chat interface with context about you and your work?
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.