A Note on Arc-Disjoint Cycles in Bipartite Tournaments
arXiv:2002.06912
Abstract
We show that for each non-negative integer k, every bipartite tournament either contains k arc-disjoint cycles or has a feedback arc set of size at most 7(k - 1).
arXiv:2002.06912
We show that for each non-negative integer k, every bipartite tournament either contains k arc-disjoint cycles or has a feedback arc set of size at most 7(k - 1).