Counting flags in triangle-free digraphs - Mathematics > CombinatoricsReport as inadecuate




Counting flags in triangle-free digraphs - Mathematics > Combinatorics - Download this document for free, or read online. Document in PDF available to download.

Abstract: Motivated by the Caccetta-Haggkvist Conjecture, we prove that every digraphon n vertices with minimum outdegree 0.3465n contains an oriented triangle.This improves the bound of 0.3532n of Hamburger, Haxell and Kostochka. The mainnew tool we use in our proof is the theory of flag algebras developed recentlyby Razborov.



Author: Jan Hladky, Daniel Kral, Sergey Norin

Source: https://arxiv.org/



DOWNLOAD PDF




Related documents