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).
生成讲解博客的中文版本
生成AI智能校验的中文版本