Almost perfect matchings in random uniform hypergraphs

DOI10.1016/S0012-365X(96)00310-XzbMATH Open0876.05075MaRDI QIDQ1363674FDOQ1363674

Authors: Michael Krivelevich 

Publication date: 10 August 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Perfect matchings in random uniform hypergraphs
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• On the number of nearly perfect matchings in almost regular uniform hypergraphs
• Perfect matchings in uniform hypergraphs with large minimum degree

zbMATH Keywords

matchingprobabilityrandom uniform hypergraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Perfect matchings in random s‐uniform hypergraphs
• A condition for matchability in hypergraphs
• Sur la cardinalite maximum des couplages d'hypergraphes aléatoires uniformes
• On a possible extension of Hall's theorem to bipartite hypergraphs
• A threshold for perfect matchings in random d-pure hypergraphs
• Title not available (Why is that?)

Cited In (8)

• Perfect matchings in random uniform hypergraphs
• Perfect matchings in random s‐uniform hypergraphs
• Co-degrees resilience for perfect matchings in random hypergraphs
• A stochastic matching model on hypergraphs
• Randomly generated intersecting hypergraphs II
• Title not available (Why is that?)
• Finding independent transversals efficiently
• The matching process and independent process in random regular graphs and hypergraphs

This page was built for publication: Almost perfect matchings in random uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363674)