Cycles in dense digraphs

Maria Chudnovsky, Paul Seymour, Blair D. Sullivan

Let G be a digraph (without parallel edges) such that every directed cycle has length at least four; let $\beta (G)$ denote the size of the smallest subset X in E(G) such that $G\X$ has…