Generalized Turán problem for directed cycles

Andrzej Grzesik, Justyna Jaworska, Bartłomiej Kielak +2

For integers $k,\ell \ge 3$, let $\mathrm{ex}(n,\overrightarrow{C_k},\overrightarrow{C_{\ell }})$ denote the maximum number of directed cycles of length $k$ in any oriented graph…