Counting flags in triangle-free digraphs

Jan Hladky, Daniel Kral, Sergey Norin

Motivated by the Caccetta-Haggkvist Conjecture, we prove that every digraph on n vertices with minimum outdegree 0.3465n contains an oriented triangle. This improves the bound of 0…