Jia Zhou

activity

20242026

collaborators

Showing 2024Show all

4 papers · 1 filter

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

Semi-Degree Condition for Arbitrary $H$ -Linked Oriented Graphs

Jia Zhou, Jin Yan

Let $H$ be a multi-digraph on $h$ vertices with $q$ arcs. An \textbf{ $H$ -subdivision} in a digraph $D$ is a subdigraph obtained by replacing every arc $uv$ of $H$ with a path…

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

math.CO2024

The generalizations of Hamiltonian in oriented graphs

Jia Zhou, Zhilan Wang, Jin Yan

An oriented graph is an orientation of a simple graph. In 2009, Keevash, Kühn and Osthus proved that every sufficiently large oriented graph $D$ of order $n$ with $(3 n - 4) /8$ is Ham…

Solutions to the linkage conjecture in tournaments

Semi-Degree Condition for Arbitrary H-Linked Oriented Graphs

Bipartitions with prescribed order of highly connected digraphs

The generalizations of Hamiltonian in oriented graphs

Semi-Degree Condition for Arbitrary $H$ -Linked Oriented Graphs