Jin Yan

activity

20242026

collaborators

Showing 2024Show all

9 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

Spanning $H$ -subdivisions and perfect $H$ -subdivision tilings in dense digraphs

Yangyang Cheng, Zhilan Wang, Jin Yan

Given a (di)graph $H$ , we say that a (di)graph $H^{'}$ is an $H$ -subdivision if $H^{'}$ is obtained from $H$ by replacing one or more edges with internally vertex-disjoint pa…

math.CO2024

A generalization of the Hamiltonian cycle in dense digraphs

Jie Zhang, Zhilan Wang, Jin Yan

Let D be a digraph and C be a cycle in D. For any two vertices x and y in D, the distance from x to y is the minimum length of a path from x to y. We denote the square of Let $D$ b…

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

Cycle-factors in oriented graphs

Zhilan Wang, Jin Yan, Jie Zhang

Let $k$ be a positive integer. A $k$ -cycle-factor of an oriented graph is a set of disjoint cycles of length $k$ that covers all vertices of the graph. In this paper, we prove that…

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

Removal paths avoiding vertices

Yuzhen Qi, Jin Yan

In this paper, we show that for any positive integer $m$ and $k \in [2]$ , let $G$ be a $(2 m + 2 k + 2)$ -connected graph and let $a_{1}, \dots, a_{m}, s, t$ be any distinct vertices of $G$ ,…

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…

math.CO2024

A Dirac-type theorem for arbitrary Hamiltonian $H$ -linked digraphs

Yangyang Cheng, Zhilan Wang, Jin Yan

Given any digraph $D$ on $n$ vertices, let $P (D)$ be the family of all directed paths in $D$ , and let $H$ be a digraph with the arc set $A (H) = {a_{1}, \dots, a_{k}}$ . The d…

Solutions to the linkage conjecture in tournaments

Spanning H-subdivisions and perfect H-subdivision tilings in dense digraphs

A generalization of the Hamiltonian cycle in dense digraphs

Semi-Degree Condition for Arbitrary H-Linked Oriented Graphs

Cycle-factors in oriented graphs

Bipartitions with prescribed order of highly connected digraphs

Removal paths avoiding vertices

The generalizations of Hamiltonian in oriented graphs

A Dirac-type theorem for arbitrary Hamiltonian H-linked digraphs

Spanning $H$ -subdivisions and perfect $H$ -subdivision tilings in dense digraphs

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

A Dirac-type theorem for arbitrary Hamiltonian $H$ -linked digraphs