• Title of article

    Counting flags in triangle-free digraphs

  • Author/Authors

    Hladk‎، نويسنده , , Jan and Krلlʹ، نويسنده , , Daniel and Norin، نويسنده , , Sergey، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2009
  • Pages
    5
  • From page
    621
  • To page
    625
  • Abstract
    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.
  • Keywords
    triangles in digraphs , Caccetta-Hنggkvist Conjecture , flag algebras
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Serial Year
    2009
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Record number

    1455230