Shuo Wei

works on

degree conditions 1 directed graphs 1 extremal combinatorics 1 graph powers 1 hamilton cycles 1

From the 1 of 5 linked papers with an AI index.

most citedScalable Batch Bayesian Optimization Via Subspace Acquisition Functions

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

3 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

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

Zhilan Wang, Shuo Wei, Jin Yan

The paper determines the exact minimum total degree condition that guarantees the square of a Hamilton cycle in large directed graphs, confirming the conjecture of DeBiasio et al.…

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…