Sciweavers

COMBINATORICS
2007

On Directed Triangles in Digraphs

13 years 10 months ago
On Directed Triangles in Digraphs
Using a recent result of Chudnovsky, Seymour, and Sullivan, we slightly improve two bounds related to the Caccetta-Haggkvist Conjecture. Namely, we show that if α ≥ 0.35312, then each n-vertex digraph D with minimum outdegree at least αn has a directed 3-cycle. If β ≥ 0.34564, then every n-vertex digraph D in which the outdegree and the indegree of each vertex is at least βn has a directed 3-cycle.
Peter Hamburger, Penny E. Haxell, Alexandr V. Kost
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2007
Where COMBINATORICS
Authors Peter Hamburger, Penny E. Haxell, Alexandr V. Kostochka
Comments (0)