Every subgraph of a binomial random k-uniform hypergraph with minimum co-degree at least (1/2+o(1))np contains a perfect matching, for p ≥ C log n/n.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Co-degrees resilience for perfect matchings in random hypergraphs
Every subgraph of a binomial random k-uniform hypergraph with minimum co-degree at least (1/2+o(1))np contains a perfect matching, for p ≥ C log n/n.