A polynomial-time algorithm almost surely decides whether a random sparsification of a dense k-graph has a perfect matching, and if one exists there are exponentially many.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Perfect Matchings in Random Sparsifications of Dense Hypergraphs
A polynomial-time algorithm almost surely decides whether a random sparsification of a dense k-graph has a perfect matching, and if one exists there are exponentially many.