Cyclic triangle factors in regular tournaments (Q2335694)

Both \textit{B. Cuckler} [``On the number of short cycles in regular tournaments'', unpublished manuscript] and \textit{R. Yuster} [Comput. Sci. Rev. 1, No. 1, 12--26 (2007; Zbl 1302.05149)] independently conjectured that when \(n\) is an odd positive multiple of 3 every regular tournament on \(n\) vertices contains a collection of \(n/3\) vertex-disjoint copies of the cyclic triangle. \textit{P. Keevash} and \textit{B. Sudakov} [J. Comb. Theory, Ser. B 99, No. 4, 709--727 (2009; Zbl 1208.05038)] demonstrated that if \(G\) is an orientation of a graph on \(n\) vertices in which every vertex admits both indegree and outdegree at least \((1/2-o(1))n\), then there exists a collection of vertex-disjoint cyclic triangles that covers all but at most 3 vertices. In this article, the authors verify the following theorem. There exists a \(c>0\) and an \(n_0\) such that for every \(n>n_0\) and for every oriented graph \(G\) on \(n\) vertices with \(\delta^{0}(G)\geq(1/2-c)n\) \(G\) admits a cyclic triangle factor if and only if \(G\) does not have a divisibility barrier. From the above theorem, the authors verify the following corollary. There exists an \(n_0\) such that when \(n\) is a multiple of 3 and \(n\geq n_0\), then \(G\) admits a cyclic triangle factor if \(G\) is an oriented graph on \(n\) vertices and \(\delta^{0}(G)\geq n/2-1\). The above corollary resolves Cuckler and Yuster's conjecture for sufficiently large regular tournaments.