Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs

Hao Huang, Jie Ma, Asaf Shapira +2

A minimum feedback arc set of a directed graph $G$ is a smallest set of arcs whose removal makes $G$ acyclic. Its cardinality is denoted by $\beta (G)$. We show that an Eulerian digraph…