The paper proves that minimum path partitions and longest paths in digraphs are orthogonal to induced acyclic subdigraphs, and establishes relaxations of Linial's two open conjectures.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Orthogonality between acyclic subdigraphs and paths in digraphs
The paper proves that minimum path partitions and longest paths in digraphs are orthogonal to induced acyclic subdigraphs, and establishes relaxations of Linial's two open conjectures.