A note on short cycles in digraphs (Q580357): Difference between revisions

Caccetta and Häggkvist have conjected that a directed graph \(D_ n\) with minimum out-degree k must contain a directed cycle of length at most \(\lceil n/k\rceil\). The conjecture is known to be true when \(k\leq 3\). The authors of the present paper describe a proof for the cases when \(k\leq 5\).