36 citations · 224 across the 54 of their papers we have counts for
7 papers · 1 filter
Turán and Ramsey numbers for -uniform minimal paths of length
Jie Han, Joanna Polcyn, Andrzej Ruciński
We determine Turán numbers for the family of 3-uniform minimal paths of length four \emph{for all }. We also establish the second and third order Turán numbers and use them to c…
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 -…
On powers of tight Hamilton cycles in randomly perturbed hypergraphs
Yulin Chang, Jie Han, Lubos Thoma
For integers and , we show that for every , there exists such that the union of -uniform hypergraph on vertices with minimum code…
Hamiltonicity in Cherry-quasirandom 3-graphs
Luyining Gan, Jie Han
We show that for any fixed , cherry-quasirandom 3-graphs of positive density and sufficiently large order with minimum vertex degree have a tight Hamilton cyc…
Cover 3-uniform hypergraphs by vertex-disjoint tight paths
Jie Han
Let be an -vertex 3-uniform hypergraph such that every pair of vertices is in at least edges. We show that contains two vertex-disjoint tight paths whose unio…
Minimum degree thresholds for Hamilton -cycles in -uniform hypergraphs
Hiep Han, Jie Han, Yi Zhao
For any even integer , integer such that , and sufficiently large , we find a tight minimum -degree condition that guarantees t…
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
Hiep Hàn, Jie Han, Patrick Morris
We investigate the emergence of spanning structures in sparse pseudo-random -uniform hypergraphs, using the following comparatively weak notion of pseudo-randomness. A -unifo…