Vertex-disjoint cycles in local tournaments

Let $r$ be a positive integer. The Bermond–Thomassen conjecture states that, a digraph of minimum out-degree at least $2r?1$ contains $r$ vertex-disjoint directed cycles. A digraph $D$ is called a local tournament if for every vertex $x$ of $D$, both the out-neighbours and the in-neighbours of $x$ induce tournaments. Note that tournaments form the subclass of local tournaments. In this paper, we verify that the Bermond–Thomassen conjecture holds for local tournaments. In particular, we prove that every local tournament $D$ with ${\delta }^{+}\left(D\right)\ge 2r?1$ contains $r$ disjoint cycles $C_1,C_2,\dots ,C_r$, satisfying that either $C_i$ has the length at most 4 or is a shortest cycle of the original digraph of $D?C_1?\dots ?C_{i?1}$ for $1\le i\le r$.