4 papers
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 graph discrepancy problems focus on finding specific subgraphs within a given oriented graph that contain a significant number of edges in one direction. This concept…