# Häggkvist, Roland

## Caccetta-Häggkvist Conjecture ★★★★

Author(s): Caccetta; Häggkvist

\begin{conjecture} Every simple digraph of order $n$ with minimum outdegree at least $r$ has a cycle with length at most $\lceil n/r\rceil$ \end{conjecture}

Keywords: