A Note on Arc-Disjoint Cycles in Bipartite Tournaments

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).

0

Discussion (0)

Sign in to join the discussion.

Loading comments…