J. Hladky, D. Král’ and S. Norin, “Counting Flags in Triangle-Free Digraphs,” Electronic Notes in Discrete Mathematics, Vol. 34, 2009, pp. 621-625. doi:10.1016/j.endm.2009.07.105

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.