Jin Yan

activity

20242026

collaborators

31 papers

cs.LG2026

Twist Flow for Inverse Problems

Shiqin Zeng, Zijun Deng, Felix J. Herrmann

In Bayesian inverse problems, posterior sampling requires generating samples that are consistent with given observations while capturing the range of plausible solutions. Direct co…

math.CO2026

Sharp connectivity thresholds for mixed rigidity packings and improved bounds for highly connected orientations of graphs

Hanzhi Bai, Jørgen Bang-Jensen, Jin Yan

Garamvölgyi, Jordán, Király and Villányi [{{\bf Forum Math. Pi} \textbf{13} (2025), Paper No.~e11}] posed two sharp connectivity conjectures for packing rigid spanning subgraphs: o…

math.CO2026

Hitting Maximum Independent Sets in Dense and Highly Connected Graphs

Hanzhi Bai, Yufei Chang, Jin Yan

For a graph $G$ , let $h (G)$ be the minimum cardinality of a vertex set meeting every maximum independent set of $G$ . We establish two complementary reduction principles for the Bol…

math.CO2026

An Exact Dominant Degree Condition for Transitive Tournament Factors in Digraphs

Yufei Chang, Shuo Wei, Jin Yan

Let $r \geq 2$ , let $T_{r}$ denote the transitive tournament on $r$ vertices, and write $d_{G}^{*} (v) := max {d_{G}^{+} (v), d_{G}^{-} (v)}$ . We prove that if $r ∣ n$ and an $n$ -vertex digraph $G$ s…

math.CO2026

Paths with Prescribed Endpoints in Semicomplete and Locally Semicomplete Digraphs

Hanzhi Bai, Jin Yan, Jia Zhou

We study two open path problems with prescribed endpoints posed by Bang-Jensen and Gutin. The first asks for a longest $(x, y)$ -path in a semicomplete digraph. The second asks wheth…

math.CO2026

A Chvátal--Erdős type condition for supereulerian digraphs with $α_{2} = 4$

Zirui Liu, Jin Yan, Jia Zhou

A digraph is \textbf{supereulerian} if it contains a spanning closed trail. Let $α_{2} (D)$ denote the maximum cardinality of a vertex set inducing no 2-cycle. In this paper, we chara…

math.CO2026

Packing and Covering Cycles Through Prescribed Vertices

Hanzhi Bai, Jin Yan

Let $G$ be a finite simple graph and let $S \subseteq V (G)$ . We prove that the minimum number of vertices meeting every cycle that intersects $S$ is at most the maximum number of ve…

math.CO2026

Complexity of Arc-Decompositions involving Perfect Matchings and Cycle Factors

Hangning Liu, Jørgen Bang-Jensen, Jin Yan +1

For two digraph properties $P_{1}$ and $P_{2}$ , a $(P_{1}, P_{2})$ -arc-decomposition of a digraph $D$ is a partition $A (D) = A_{1} \cup ˙ A_{2}$ such that the spanning subdigraphs $D[A_…

math.CO2026

Spanning $H$ -subdivisions with Prescribed Path Lengths

Zhilan Wang, Shuo Wei, Jin Yan

We study spanning $H$ -subdivisions in dense graphs where the length of every subdivision path is prescribed in advance. This problem is motivated in part by a question of Pavez-Sig…

math.CO2026

Nearly balanced spanning subdivisions in dense digraphs

Zhilan Wang, Shuo Wei, Jin Yan

Pavez-Signé [Combin. Probab. Comput. 33 (2024), 121--128] conjectured a Dirac-type condition for spanning $H$ -subdivisions and asked whether the subdivision paths can additionally…

math.CO2026

Sparse spanning $k$ -strong oriented subdigraphs in split digraphs

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

Jackson and Thomassen conjectured that every $2 k$ -strong digraph admits a spanning $k$ -strong oriented subdigraph [Ann. N. Y. Acad. Sci. 555 (1989) 402-412]. The conjecture holds f…

math.CO2026

Highly connected spanning oriented subdigraphs in generalizations of semicomplete digraphs

Jia Zhou, Jørgen Bang-Jensen, Tong Zhou +1

Let $k$ be a positive integer. Jackson and Thomassen conjectured in 1989 that there exists an integer function $f (k)$ such that every $f (k)$ -strong digraph admits a spanning $k$ -st…

math.CO2026

The exact total degree threshold for the square of a Hamilton cycle in digraphs

Zhilan Wang, Shuo Wei, Jin Yan

The Pósa-Seymour conjecture establishes the minimum degree threshold required to guarantee the presence of the $k$ th power of a Hamilton cycle in a graph. Following numerous partia…

math.CO2026

K-Arc-Strong Orientations Of Semicomplete Digraphs

Tong Zhou, Jørgen Bang-Jensen, Jia Zhou +1

Results by Jackson and Frank imply that every 2k-arc-strong digraph D contains a spanning k-arc-strong oriented subdigraph. This is best possible, even for very dense digraphs. A d…

cs.DM2026

Polynomial Algorithms for Minimum Degree Partitions in Semicomplete Digraphs

Hanzhi Bai, Jin Yan

A 2-partition of a digraph is a partition of its vertex set into two nonempty parts. Degree-constrained 2-partition problems are generally computationally difficult, even when the…

math.CO2026

Ramsey-Turán Type Problem for Perfect Transitive Triangle Tilings in Digraphs

Zhimin Wang, Zhilan Wang, Jin Yan

The classical Corrádi-Hajnal theorem states that for any multiple $n$ of $3$ , if $G$ is a graph with $n$ vertices and $δ (G) \geq 2 n /3$ , then $G$ can be partitioned into $n /3$ verte…

math.CO2026

Oriented Discrepancy of The Square of Hamilton Cycles

Yufei Chang, Yangyang Cheng, Zhilan Wang +2

For an oriented graph $G$ , the oriented discrepancy problem concerns the existence of a spanning subgraph of $G$ with a large imbalance between its forward and backward edge orient…

math.CO2026

Spanning Subdivisions in Robustly Expanding Digraphs

Zhilan Wang, Jin Yan, Shuo Wei

Kühn, Osthus and Treglown [\emph{J. Combin. Theory Ser. B} \textbf{100} (2010)] proved that every sufficiently large robust outexpander with linear minimum semi-degree contains a H…

math.CO2026

An Ore-type Theorem for Oriented Discrepancy of Hamilton Cycles

Yufei Chang, Yangyang Cheng, Zhilan Wang +2

Oriented discrepancy concerns the existence of prescribed subgraphs whose edges exhibit a substantial imbalance between the two directions. The Hamilton cycle case was first invest…

math.CO2026

On the 2-Linkage Problem for Split Digraphs

Xiaoying Chen, Jørgen Bang-Jensen, Jin Yan +1

A digraph is {\bf $ k $-linked} if for arbitary two disjoint vertex sets $\{s_1, \ldots, s_k\}$ and $\{t_1, \ldots, t_k\}$, there exist vertex-disjoint directed paths \(P_1,…

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…

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…

Twist Flow for Inverse Problems

Sharp connectivity thresholds for mixed rigidity packings and improved bounds for highly connected orientations of graphs

Hitting Maximum Independent Sets in Dense and Highly Connected Graphs

An Exact Dominant Degree Condition for Transitive Tournament Factors in Digraphs

Paths with Prescribed Endpoints in Semicomplete and Locally Semicomplete Digraphs

A Chvátal--Erdős type condition for supereulerian digraphs with α2​=4

Packing and Covering Cycles Through Prescribed Vertices

Complexity of Arc-Decompositions involving Perfect Matchings and Cycle Factors

Spanning H-subdivisions with Prescribed Path Lengths

Nearly balanced spanning subdivisions in dense digraphs

Sparse spanning k-strong oriented subdigraphs in split digraphs

Highly connected spanning oriented subdigraphs in generalizations of semicomplete digraphs

The exact total degree threshold for the square of a Hamilton cycle in digraphs

K-Arc-Strong Orientations Of Semicomplete Digraphs

Polynomial Algorithms for Minimum Degree Partitions in Semicomplete Digraphs

Ramsey-Turán Type Problem for Perfect Transitive Triangle Tilings in Digraphs

Oriented Discrepancy of The Square of Hamilton Cycles

Spanning Subdivisions in Robustly Expanding Digraphs

An Ore-type Theorem for Oriented Discrepancy of Hamilton Cycles

On the 2-Linkage Problem for Split Digraphs

Proof of the linkage conjecture for highly connected tournaments

On the k-linkage problem for generalizations of semicomplete digraphs

Solutions to the linkage conjecture in tournaments

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

A Chvátal--Erdős type condition for supereulerian digraphs with $α_{2} = 4$

Spanning $H$ -subdivisions with Prescribed Path Lengths

Sparse spanning $k$ -strong oriented subdigraphs in split digraphs

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

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