A Note on Arc-Disjoint Cycles in Bipartite Tournaments
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).
cs.DS↗
arXiv subjects
Ajay Saju Jacob
Publications and source records attributed to Ajay Saju Jacob.