Feedback edge set in bipartite digraph
Let \(\beta(G)\) denote the minimum size of a feedback edge set of a digraph \(G\), and let \(\gamma(G)\) denote the number of unordered pairs of nonadjacent vertices. Motivated by the Chudnovsky--Seymour--Sullivan conjecture for \(3\)-free digraphs, we study the corresponding feedback-edge problem for bipartite digrap...