no. 17 · Wednesday 18 November 2026
Directed triangles in oriented graphs without a directed cycle of length $3t$
Abstract
For integers $k,\ell\ge 3$, let $\operatorname{ex}(n,\Cdir_k,\Cdir_\ell)$ denote the maximum number of directed cycles of length $k$ in an $n$-vertex oriented graph containing no directed cycles of length $\ell$. Grzesik, Jaworska, Kielak, Kuc and Ślusarczyk~\cite{GJ} systematically studied the generalized Turán problem for directed cycles and conjectured that, for every fixed integer $t\ge 2$, $\operatorname{ex}(n,\Cdir_3,\Cdir_{3t})=\frac{t-1}{4}n^2+o(n^2)$. They proved this asymptotic formula for $t=2$. In this paper, we prove it for every fixed integer $t\ge 3$, thereby confirming the conjecture.
- fields
- Combinatorics