Yulin Chang

collaborators

2 papers

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 $k$ -graph $H$ with minimum vertex degree $Ω (n^{k - 1})$ to ensure an $F$ -…

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 $G$ 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}'…