Perfect matchings in random s‐uniform hypergraphs

DOI10.1002/rsa.3240070104zbMath0839.05074OpenAlexW2013430224WikidataQ57401571 ScholiaQ57401571MaRDI QIDQ4847395

Svante Janson, Alan M. Frieze

Publication date: 5 June 1996

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240070104

zbMATH Keywords

hypergraphrandom graphperfect matching\(s\)-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)

Related Items

Sharp thresholds of graph properties, and the $k$-sat problem, Almost perfect matchings in random uniform hypergraphs, Graph factors and factorization: 1985--2003: a survey, Asymptotics for Shamir's problem, Perfect Matchings in Random r-regular, s-uniform Hypergraphs, Real and complex interpolation and extrapolation of compact operators, Increasing the flexibility of the herding attack, Hitting times for Shamir’s problem, Distributed algorithms for matching in hypergraphs

Cites Work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs