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 kgeq3, the binomial k-uniform random hypergraph Hn,pk contains edge-disjoint perfect matchings, provided pgeqfraclogCnnk−1, where C:=C(k) is an integer depending only on k. Our result for N is asymptotically best optimal and for p is optimal up to the polylog(n) factor.












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)