Some approaches to a conjecture on short cycles in digraphs (Q1613363): Difference between revisions

Suppose \(D\) is a digraph on \(n\) vertices that all have in degree and out degree of at least \(n/3\). The authors establish properties of \(D\) for a possible counterexample to the conjecture: \(D\) contains a directed cycle of length 2 or 3.