Counting flags in triangle-free digraphs
Motivated by the Caccetta-Häggkvist Conjecture, we prove that every digraph on n vertices with minimum outdegree 0:3465n contains an oriented triangle. This improves the bound of 0:3532n of Hamburger, Haxell and Kostochka. The main new tool we use in our proof is the theory of flag algebras developed recently by Razborov.
Mathematics Subject Classification (2000)05C35
Unable to display preview. Download preview PDF.
- L. Caccetta and R. Häggkvist: On minimal digraphs with given girth, in: Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1978), Congress. Numer., XXI, 181-187, Winnipeg, Man., 1978. Utilitas Math.Google Scholar
- P. Hamburger, P. Haxell and A. Kostochka: On directed triangles in digraphs, Electron. J. Combin. 14 Note 19, (electronic), 2007.Google Scholar
- B. Sullivan: A summary of results and problems related to the Caccetta-Häggkvist conjecture, unpublished, 2006.Google Scholar