Unavoidable butterfly minors in digraphs of large cycle rank

Meike Hatzel, O-joung Kwon, Myounghwan Lee +1

Cycle rank is one of the depth parameters for digraphs introduced by Eggan in 1963. We show that there exists a function $f:\mathbb{N}\to \mathbb{N}$ such that every digraph of cyc…