Counting flags in triangle-free digraphs - Mathematics > CombinatoricsReportar como inadecuado




Counting flags in triangle-free digraphs - Mathematics > Combinatorics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

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.



Autor: Jan Hladky, Daniel Kral, Sergey Norin

Fuente: https://arxiv.org/



DESCARGAR PDF




Documentos relacionados