4 papers
Degree conditions for spanning expansion hypertrees
Mengjiao Rao, Nicolás Sanhueza-Matamala, Lin Sun +2
The -expansion of a graph is the -uniform hypergraph obtained from by adding new vertices to every edge. We determine, for all , asymptotically op…
Minimum degree conditions for Hamilton -cycles in -uniform hypergraphs
Jie Han, Lin Sun, Guanghui Wang
We show that for and sufficiently large , every 5-graph on vertices with contains a Hamilton 2-cycle. This minimum 2-degree…
Tiling in dense graphs
Nannan Chen, Xizhi Liu, Lin Sun +1
We determine asymptotically the two extremal constructions for the tiling problem of the -shaped tree. In particular, the first extremal construction is close to the complement…
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 and , we show that there exists a constant such that if $…