activity
20192026
most citedRainbow Pancyclicity in Graph Systems

4 citations · 9 across the 10 of their papers we have counts for

collaborators

12 papers

math.CO2026

The perfect 1-factorisation conjecture holds asymptotically

Yangyang Cheng, Amedeo Sgueglia

A famous conjecture of Anton Kotzig states that for every even integer , the complete graph of order can be decomposed into perfect matchings such that ev…

math.CO2025

A step toward Chen-Lih-Wu conjecture

Yangyang Cheng, Zhenyu Li, Wanting Sun +1

An equitable -coloring of a graph is a proper -coloring where the sizes of any two different color classes differ by at most one. In 1973, Meyer conjectured that every connec…

math.CO2025

An exact Ore-degree condition for Hamilton cycles in oriented graphs

Yulin Chang, Yangyang Cheng, Tianjiao Dai +2

An oriented graph is a digraph that contains no 2-cycles, i.e., there is at most one arc between any two vertices. We show that every oriented graph of sufficiently large order…

math.CO2025

Transversal Hamilton cycles in digraph collections

Yangyang Cheng, Heng Li, Wanting Sun +1

Given a collection of digraphs on the common vertex set , an -edge digraph with vertices in is \textit{transversal} in $\mathcal…

math.CO2024

An El-Zahar Type Theorem in -graphs under Codegree Condition

Yangyang Cheng, Mengjiao Rao, Guanghui Wang +1

A -uniform loose cycle, denoted by , is a -graph on vertices whose vertices can be arranged cyclically so that each hyperedge consists of three consecutive vertices,…

math.CO2024

Transversal Hamilton paths and cycles

Yangyang Cheng, Wanting Sun, Guanghui Wang +1

Given a collection of graphs on the common vertex set of size , an -edge graph on the same vertex set is transversal in $\mat…

math.CO2024

Stability of transversal Hamilton cycles and paths

Yangyang Cheng, Katherine Staden

Given graphs all on a common vertex set and a graph with , a copy of is \emph{transversal} or \emph{rainbow} if it contains one edge from each $G…

math.CO2023

Transversals via regularity

Yangyang Cheng, Katherine Staden

Given graphs all on the same vertex set and a graph with , a copy of is transversal or rainbow if it contains at most one edge from each …

math.CO2021

Transversal Hamilton cycle in hypergraph systems

Yangyang Cheng, Jie Han, Bin Wang +2

A -graph system is a family of not necessarily distinct -graphs on the same -vertex set and a -graph on is said to be $\textb…

math.CO2021★ 2 cited

Rainbow spanning structures in graph and hypergraph systems

Yangyang Cheng, Jie Han, Bin Wang +1

We study the following rainbow version of subgraph containment problems in a family of (hyper)graphs, which generalizes the classical subgraph containment problems in a single host…

math.CO2020★ 3 cited

Integer colorings with forbidden rainbow sums

Yangyang Cheng, Yifan Jing, Lina Li +2

For a set of positive integers , an -coloring of is rainbow sum-free if it contains no rainbow Schur triple. In this paper we initiate the study of the rain…

math.CO2019★ 4 cited

Rainbow Pancyclicity in Graph Systems

Yangyang Cheng, Guanghui Wang, Yi Zhao

Let be graphs on the same vertex set of size , each graph with minimum degree . A recent conjecture of Aharoni asserts that there exists a rainbow H…