Publication details

COUNTING FLAGS IN TRIANGLE-FREE DIGRAPHS

Authors

HLADKY J KRÁĽ Daniel NORIN S

Year of publication 2017
Type Article in Periodical
Magazine / Source Combinatorica : an international journal of the János Bolyai Mathematical Society
Citation
Doi http://dx.doi.org/10.1007/s00493-015-2662-5
Description Motivated by the Caccetta-Haggkvist 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.

You are running an old browser version. We recommend updating your browser to its latest version.

More info