1 citations · 1 across the 7 of their papers we have counts for
6 papers · 1 filter
Degree conditions for -strong orientations of digraphs
Jørgen Bang-Jensen, Shuo Wei
Jackson and Thomassen conjectured that every -strong digraph contains a spanning -strong oriented subdigraph. We prove sharp degree conditions for the existence of such a su…
An Exact Dominant Degree Condition for Transitive Tournament Factors in Digraphs
Yufei Chang, Shuo Wei, Jin Yan
Let , let denote the transitive tournament on vertices, and write . We prove that if and an -vertex digraph s…
Spanning -subdivisions with Prescribed Path Lengths
Zhilan Wang, Shuo Wei, Jin Yan
We study spanning -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…
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 -subdivisions and asked whether the subdivision paths can additionally…
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 th power of a Hamilton cycle in a graph. Following numerous partia…
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…