Yangyang Cheng

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2026

Oriented Discrepancy of The Square of Hamilton Cycles

Yufei Chang, Yangyang Cheng, Zhilan Wang +2

For an oriented graph $G$ , the oriented discrepancy problem concerns the existence of a spanning subgraph of $G$ with a large imbalance between its forward and backward edge orient…

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 $G$ that contain a significant number of edges in one direction. This concept…

math.CO2024

Spanning $H$ -subdivisions and perfect $H$ -subdivision tilings in dense digraphs

Yangyang Cheng, Zhilan Wang, Jin Yan

Given a (di)graph $H$ , we say that a (di)graph $H^{'}$ is an $H$ -subdivision if $H^{'}$ is obtained from $H$ by replacing one or more edges with internally vertex-disjoint pa…

math.CO2024

On the length of directed paths in digraphs

Yangyang Cheng, Peter Keevash

Thomassé conjectured the following strengthening of the well-known Caccetta-Haggkvist Conjecture: any digraph with minimum out-degree $δ$ and girth $g$ contains a directed path of…

math.CO2024

A Dirac-type theorem for arbitrary Hamiltonian $H$ -linked digraphs

Yangyang Cheng, Zhilan Wang, Jin Yan

Given any digraph $D$ on $n$ vertices, let $P (D)$ be the family of all directed paths in $D$ , and let $H$ be a digraph with the arc set $A (H) = {a_{1}, \dots, a_{k}}$ . The d…

Oriented Discrepancy of The Square of Hamilton Cycles

An Ore-type Theorem for Oriented Discrepancy of Hamilton Cycles

Spanning H-subdivisions and perfect H-subdivision tilings in dense digraphs

On the length of directed paths in digraphs

A Dirac-type theorem for arbitrary Hamiltonian H-linked digraphs

Spanning $H$ -subdivisions and perfect $H$ -subdivision tilings in dense digraphs

A Dirac-type theorem for arbitrary Hamiltonian $H$ -linked digraphs