The complexity of perfect matchings and packings in dense hypergraphs

Jie Han, Andrew Treglown

Given two $k$-graphs $H$ and $F$, a perfect $F$-packing in $H$ is a collection of vertex-disjoint copies of $F$ in $H$ which together cover all the vertices in $H$. In the case whe…