Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture (Q1356730)

L. Caccetta and R. Häggkvist conjectured that in a digraph \(D\) on \(n\) vertices, the girth of \(D\) is at most \(\lfloor n/d\rfloor\), if each vertex is of out-degree at least \(d\). The paper discusses the case where \(d=\lceil n/3\rceil\).