3 papers
math.CO2026
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…
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 that contain a significant number of edges in one direction. This concept…
math.CO2024
Spanning -subdivisions and perfect -subdivision tilings in dense digraphs
Yangyang Cheng, Zhilan Wang, Jin Yan
Given a (di)graph , we say that a (di)graph is an -subdivision if is obtained from by replacing one or more edges with internally vertex-disjoint pa…