"A threshold for perfect matchings in random d-pure hypergraphs."

Jeanette P. Schmidt, Eli Shamir (1983)

> Home

Details and statistics

DOI: 10.1016/0012-365X(83)90044-4

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/SchmidtS83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/SchmidtS83
Jeanette P. Schmidt, Eli Shamir:
A threshold for perfect matchings in random d-pure hypergraphs. Discret. Math. 45(2-3): 287-295 (1983)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.