P. Hamburger, P. Haxell and A. Kostochka, “On the Directed Triangles in Digraphs,” Electronic Journal of Combinatorics, Vol. 14, No. 19, 2007.
has been cited by the following article:
TITLE: A Note on Directed 5-Cycles in Digraphs
AUTHORS: Hao Liang, Junming Xu
KEYWORDS: Digraph; Directed Cycle
JOURNAL NAME: Applied Mathematics, Vol.3 No.7, June 21, 2012
ABSTRACT: 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.