Jin Yan

activity

20242026

collaborators

Showing math.COShow all

28 papers · 1 filter

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

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

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