Yulin Chang

most citedOn powers of tight Hamilton cycles in randomly perturbed hypergraphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2023

The threshold for powers of tight Hamilton cycles in random hypergraphs

Yulin Chang, Jie Han, Lin Sun

We investigate the occurrence of powers of tight Hamilton cycles in random hypergraphs. For every $r \geq 3$ and $k \geq 1$ , we show that there exists a constant $C > 0$ such that if $…

math.CO2020★ 1 cited

On powers of tight Hamilton cycles in randomly perturbed hypergraphs

Yulin Chang, Jie Han, Lubos Thoma

For integers $k \geq 3$ and $r \geq 2$ , we show that for every $α > 0$ , there exists $ε > 0$ such that the union of $k$ -uniform hypergraph on $n$ vertices with minimum code…