Recall that Johansson, Kahn, and Vu [1]} proved that the threshold for the appearance of perfect matchings in \(\mathbb {G}^{(k)}(n,p)\)  is order \(\log n / n^{k-1}\) . We show that this holds more generally for binomial random subgraphs of any hypergraph satisfying the minimum-degree condition above.
