Shuo Wei

collaborators

Showing math.COShow all

5 papers · 1 filter

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

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

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

An Ore-type Theorem for Oriented Discrepancy of Hamilton Cycles

Yufei Chang, Yangyang Cheng, Zhilan Wang +2

Oriented graph discrepancy problems focus on finding specific subgraphs within a given oriented graph $G$ that contain a significant number of edges in one direction. This concept…

An Exact Dominant Degree Condition for Transitive Tournament Factors in Digraphs

Spanning H-subdivisions with Prescribed Path Lengths

Nearly balanced spanning subdivisions in dense digraphs

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

An Ore-type Theorem for Oriented Discrepancy of Hamilton Cycles

Spanning $H$ -subdivisions with Prescribed Path Lengths