On the minimal feedback arc set of m-free Digraphs

For a simple digraph $G$, let $β(G)$ be the size of the smallest subset $X\subseteq E(G)$ such that $G-X$ has no directed cycles, and let $γ(G)$ be the number of unordered pairs of nonadjacent vertices in $G$. A digraph $G$ is called $m$-free if $G$ has no directed cycles of length at most $m$. This paper proves that $β(G)\leq \frac{1}{m-2}γ(G)$ for any $m$-free digraph $G$, which generalized some known results.

No reviews yet.

No comments yet.