6 papers · 1 filter
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…
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…
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…
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…
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,…
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…