Jin Yan

activity

20242026

collaborators

Showing 2025 · math.COShow all

2 papers · 2 filters

math.CO2025

Proof of the linkage conjecture for highly connected tournaments

Jia Zhou, Jin Yan

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

math.CO2025

On the $k$ -linkage problem for generalizations of semicomplete digraphs

Jia Zhou, Jørgen Bang-Jensen, Jin Yan

A directed graph (digraph) $D$ is $k$ -linked if $∣ D ∣ \geq 2 k$ , and for any $2 k$ distinct vertices $x_{1}, \dots, x_{k}, y_{1}, \dots, y_{k}$ of $D$ , there exist vertex-disjoi…

Proof of the linkage conjecture for highly connected tournaments

On the k-linkage problem for generalizations of semicomplete digraphs

On the $k$ -linkage problem for generalizations of semicomplete digraphs