Bipartitions with prescribed order of highly connected digraphs

Yuzhen Qi, Jin Yan, Jia Zhou

A digraph is strongly connected if it has a directed path from $x$ to $y$ for every ordered pair of distinct vertices $x,y$ and it is strongly $k$-connected if it has at least $k+…