Perfect matchings in random sparsifications of Dirac hypergraphs

Dong Yeap Kang, Tom Kelly, Daniela Kühn +2

For all integers $n\ge k>d\ge 1$, let $m_d(k,n)$ be the minimum integer $D\ge 0$ such that every $k$-uniform $n$-vertex hypergraph $\mathcal{H}$ with minimum $d$-degree $δ…