The number of k-arc acyclic subdigraphs in which every vertex can reach a fixed root is independent of the root, for any balanced digraph.
Title resolution pending
1 Pith paper cite this work, alongside 274 external citations. Polarity classification is still indexing.
1
Pith paper citing it
274
external citations · OpenAlex
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
An equality for balanced digraphs
The number of k-arc acyclic subdigraphs in which every vertex can reach a fixed root is independent of the root, for any balanced digraph.