Informace o publikaci
COUNTING FLAGS IN TRIANGLE-FREE DIGRAPHS
| Autoři | |
|---|---|
| Rok publikování | 2017 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | Combinatorica : an international journal of the János Bolyai Mathematical Society |
| Citace | |
| Doi | http://dx.doi.org/10.1007/s00493-015-2662-5 |
| Popis | 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. |