Counting flags in triangle-free digraphs

We prove that every digraph on n vertices with minimum out-degree 0.3465n contains an oriented triangle. This improves the bound of 0.3532n of Hamburger, Haxell and Kostochka. The main tool for our proof is the theory of flag algebras developed recently by Razborov.