A threshold for perfect matchings in random d-pure hypergraphs (Q1839262): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Jeanette P. Schmidt / rank | |||
Property / author | |||
Property / author: Jeanette P. Schmidt / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198785 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4773670 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4065548 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the combinatorial problems which I would most like to see solved / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: One-factor in random graphs based on vertex choice / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(83)90044-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1963909248 / rank | |||
Normal rank |
Latest revision as of 11:59, 30 July 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