A threshold for perfect matchings in random d-pure hypergraphs
type: Item
instance of: scholarly article
title: A threshold for perfect matchings in random d-pure hypergraphs
zbMATH Open document ID: 0512.05047
DOI: 10.1016/0012-365X(83)90044-4
author: Eli Shamir
author: Jeanette P. Schmidt
published in: Discrete Mathematics
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 60F20
zbMATH DE Number: 3807654
zbMATH Keywords: random hypergraph
zbMATH Keywords: perfect matching
zbMATH Keywords: d-partite hypergraph
MaRDI profile type: Publication
cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings
cites work: Q4198785
cites work: Q4773670
cites work: Q4065548
cites work: On the combinatorial problems which I would most like to see solved
cites work: Q4198056
cites work: One-factor in random graphs based on vertex choice
full work available at URL: 0012-365x(83)90044-4
OpenAlex ID: W1963909248
description: scientific article; zbMATH DE number 3807654