Packing perfect matchings in random hypergraphs
From MaRDI portal
Abstract: We introduce a new procedure for generating the binomial random graph/hypergraph models, referred to as emph{online sprinkling}. As an illustrative application of this method, we show that for any fixed integer , the binomial -uniform random hypergraph contains edge-disjoint perfect matchings, provided , where is an integer depending only on . Our result for is asymptotically best optimal and for is optimal up to the factor.
Recommendations
Cited in
(10)- Dirac-type theorems in random hypergraphs
- Perfect fractional matchings in \(k\)-out hypergraphs
- Perfect packings in quasirandom hypergraphs. I.
- Perfect matchings in random s‐uniform hypergraphs
- Packing trees of unbounded degrees in random graphs
- Pseudorandom hypergraph matchings
- Packing random graphs and hypergraphs
- Perfect Packings in Quasirandom Hypergraphs II
- Packing loose Hamilton cycles
- Packing and counting arbitrary Hamilton cycles in random digraphs
This page was built for publication: Packing perfect matchings in random hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642740)