Directed triangles in digraphs (Q1127878): Difference between revisions

Let \(c\) be the smallest possible value such that every digraph on \(n\) vertices with minimum outdegree at least \(cn\) contains a directed triangle. It was conjectured by Caccetta and Häggkvist in 1978 that \(c=1/3\). Recently Bondy showed that \(c\leq (2\sqrt{6}- 3)/5= 0.3797\ldots\) by using some counting arguments. In this note, we prove that \(c\leq 3-\sqrt{7}= 0.3542\ldots\).