Almost perfect matchings in random uniform hypergraphs

DOI10.1016/S0012-365X(96)00310-XMaRDI QIDQ1363674zbMATH OpenFDO

Authors Michael Krivelevich

Publication date 10 August 1997

Published in Discrete Mathematics (Search for Journal in Brave)

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)

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

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 949656 (Why is no real title available?)
• A condition for matchability in hypergraphs
• A threshold for perfect matchings in random d-pure hypergraphs
• On a possible extension of Hall's theorem to bipartite hypergraphs
• Perfect matchings in random s‐uniform hypergraphs
• Sur la cardinalite maximum des couplages d'hypergraphes aléatoires uniformes

Cited in

(13)

• A stochastic matching model on hypergraphs
• Co-degrees resilience for perfect matchings in random hypergraphs
• scientific article; zbMATH DE number 949656 (Why is no real title available?)
• On the matching number and the independence number of a random induced subhypergraph of a hypergraph
• Randomly generated intersecting hypergraphs II
• Perfect matchings in random uniform hypergraphs
• Pseudorandom hypergraph matchings
• Packing perfect matchings in random hypergraphs
• Perfect matchings in random s‐uniform hypergraphs
• The maximum and minimum degree of the random \(r\)-uniform \(r\)-partite hypergraphs
• Finding independent transversals efficiently
• Dirac-type theorems in random hypergraphs
• 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)