Showing math.COShow all
3 papers · 1 filter
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.CO2020
Factors in randomly perturbed hypergraphs
Yulin Chang, Jie Han, Yoshiharu Kohayakawa +2
We determine, up to a multiplicative constant, the optimal number of random edges that need to be added to a -graph with minimum vertex degree to ensure an -…
math.CO2018
List strong edge-coloring of graphs with maximum degree 4
Baochen Zhang, Yulin Chang, Jie Hu +2
A strong edge-coloring of a graph is an edge-coloring such that any two edges on a path of length three receive distinct colors. We denote the strong chromatic index by $χ_{s}'…