Directed triangles in oriented graphs without a directed cycle of length $3t$

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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-17
DOI
https://doi.org/10.48550/arxiv.2611.22104
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Directed triangles in oriented graphs without a directed cycle of length $3t$

Li Shuchao, Mingli Wang
arXiv (Cornell University)
Limits and Structures in Graph Theory
preprint

Directed triangles in oriented graphs without a directed cycle of length $3t$

Li Shuchao, Mingli Wang
preprint en

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.

arXiv (Cornell University)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon