collaborators

1 paper

math.CO2025

Perfect Matchings in Random Sparsifications of Dense Hypergraphs

Jie Han, Jingwen Zhao

Given \(1\le\ell <k \) and \(δ\geq 0\), let \(\mathbf{PM}(k,\ell,δ)\) be the decision problem for the existence of perfect matchings in \(n\)-vertex \(k\)-uniform hypergraphs wit…