A threshold for perfect matchings in random d-pure hypergraphs
From MaRDI portal
Publication:1839262
DOI10.1016/0012-365X(83)90044-4zbMath0512.05047MaRDI QIDQ1839262
Eli Shamir, Jeanette P. Schmidt
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Perfect Matchings in Random r-regular, s-uniform Hypergraphs, Component structure in the evolution of random hypergraphs, Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number, Almost perfect matchings in random uniform hypergraphs
Cites Work