Proves that bounded-degree oriented trees and limited tree-like structures (few disjoint cycles, small subdivided graphs) embed as spanning subdigraphs in digraphs with minimum semidegree n/2 + o(n).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2020 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Trees and treelike structures in dense digraphs
Proves that bounded-degree oriented trees and limited tree-like structures (few disjoint cycles, small subdivided graphs) embed as spanning subdigraphs in digraphs with minimum semidegree n/2 + o(n).