On the acyclic disconnection of multipartite tournaments ?
The acyclic disconnection of a digraph D D is the maximum number of components that can be obtained by deleting from D D the set of arcs of an acyclic subdigraph. We give bounds for the acyclic disconnection of strongly connected bipartite tournaments and of regular bipartite tournaments. For the latter case, we exhibit an infinite family of tournaments with acyclic disconnection equal to 4.
acyclic disconnection multipartite tournaments regular bipartite tournaments