12 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…
Ramsey-Turán Type Problem for Perfect Transitive Triangle Tilings in Digraphs
Zhimin Wang, Zhilan Wang, Jin Yan
The classical Corrádi-Hajnal theorem states that for any multiple of , if is a graph with vertices and , then can be partitioned into verte…
Oriented Discrepancy of The Square of Hamilton Cycles
Yufei Chang, Yangyang Cheng, Zhilan Wang +2
For an oriented graph , the oriented discrepancy problem concerns the existence of a spanning subgraph of with a large imbalance between its forward and backward edge orient…
The -linkage problems in sparse robustly expanding digraphs
Zhilan Wang, Jin Yan
The Nash-Williams conjecture establishes degree sequence conditions ensuring Hamilton cycles in digraphs. An asymptotic version of this conjecture for large digraphs was independen…