3 citations · 8 across the 7 of their papers we have counts for
14 papers
Large -tilings and Hamilton -cycles in -uniform hypergraphs
Luyining Gan, Jie Han, Lin Sun +1
Let be the -uniform hypergraph with two edges intersecting in two vertices. Our main result is that any -vertex 3-uniform hypergraph with at least $\binom{n}{3} - \…
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 -…
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…
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…
On Perfect Matchings in -complexes
Jie Han
Keevash and Mycroft [\emph{Mem.~Amer.~Math.~Soc., 2015}] developed a geometric theory for hypergraph matchings and characterized the dense simplicial complexes that contain a perfe…