Work

Minimum outdegree forcing directed cycles

Year: 2026
Type: preprint
Abstract: The Caccetta-Häggkvist conjecture, one of the best known open problems on oriented graphs, asserts that every oriented graph on $n$ vertices with minimum outdegree at least $n/\ell$ contains a directed cycle of length at most $\ell$. Motivated by it, Kelly, Kühn and Osthus asked for the minimum degree condition that forces a directed cycle of length exactly $\ell$. The semidegree version of this problem was recently solved, but the methods used there rely on bounding the directed diameter, which requires control over the indegrees. In the setting of the Caccetta-Häggkvist conjecture, where only the outdegrees are bounded, the answer was known only for $\ell$ not divisible by $3$. We determine the optimal minimum outdegree forcing a directed cycle of length $\ell$ for every sufficiently large $\ell$ and $n$. This establishes the outdegree version of the Kelly-Kühn-Osthus conjecture for all large $\ell$, up to a small correction of the additive term, which in general cannot be avoided.
Language: English
Open Access status: green
OpenAlex ID: W7236189771
Cites: 8
Cited by:
Related to: 10