A digraph with minimum semidegree above ℓ/(2ℓ−1) times the tree size and with vertices of large out- and indegree contains every balanced antidirected bounded-degree tree of that size.
Cycles of given length in oriented graphs.Journal of Combi- natorial Theory, Series B, 100(3):251–264, 2010
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
other 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
Antidirected trees in directed graphs
A digraph with minimum semidegree above ℓ/(2ℓ−1) times the tree size and with vertices of large out- and indegree contains every balanced antidirected bounded-degree tree of that size.