2000 character limit reached
A Note on Arc-Disjoint Cycles in Bipartite Tournaments
Published 17 Feb 2020 in cs.DS | (2002.06912v1)
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).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.