Every digraph of sufficiently large cycle rank contains a directed ladder, a directed cycle chain, or a directed tree chain of order k as a butterfly minor.
Quickly excluding a forest
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Unavoidable butterfly minors in digraphs of large cycle rank
Every digraph of sufficiently large cycle rank contains a directed ladder, a directed cycle chain, or a directed tree chain of order k as a butterfly minor.