Degree conditions for spanning expansion hypertrees

Mengjiao Rao, Nicolás Sanhueza-Matamala, Lin Sun +2

The $k$-expansion of a graph $G$ is the $k$-uniform hypergraph obtained from $G$ by adding $k-2$ new vertices to every edge. We determine, for all $k>d\ge 1$, asymptotically op…