Jia Zhou

collaborators

2 papers

math.CO2024

Solutions to the linkage conjecture in tournaments

Jia Zhou, Jin Yan

A digraph $D$ is $k$ -linked if for every $2 k$ -tuple $x_{1}, \dots, x_{k}, y_{1}, \dots, y_{k}$ of distinct vertices in $D$ , there exist $k$ pairwise vertex-disjoint paths $P_1,\ldots,…

math.CO2024

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+…