The maximum number of directed k-cycles in an n-vertex oriented graph with no directed l-cycle is Theta(n^k) when k does not divide l, Theta(n^(k-1)) when k divides l, and the leading constant is determined for large l.
Testing subgraphs in directed graphs.Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 700–709, 2003
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Generalized Tur\'an problem for directed cycles
The maximum number of directed k-cycles in an n-vertex oriented graph with no directed l-cycle is Theta(n^k) when k does not divide l, Theta(n^(k-1)) when k divides l, and the leading constant is determined for large l.