From the 1 of 7 linked papers with an AI index.
7 papers
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.…
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 ver…
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…
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…
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…