A threshold for perfect matchings in random d-pure hypergraphs (Q1839262): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:34, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A threshold for perfect matchings in random d-pure hypergraphs |
scientific article |
Statements
A threshold for perfect matchings in random d-pure hypergraphs (English)
0 references
1983
0 references
random hypergraph
0 references
perfect matching
0 references
d-partite hypergraph
0 references
