A threshold for perfect matchings in random d-pure hypergraphs
- 31 December 1983
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 45 (2-3) , 287-295
- https://doi.org/10.1016/0012-365x(83)90044-4
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- One-factor in random graphs based on vertex choiceDiscrete Mathematics, 1982
- On the combinatorial problems which I would most like to see solvedCombinatorica, 1981
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979