Almost perfect matchings in random uniform hypergraphs
From MaRDI portal
Publication:1363674
DOI10.1016/S0012-365X(96)00310-XzbMath0876.05075MaRDI QIDQ1363674
Publication date: 10 August 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On a possible extension of Hall's theorem to bipartite hypergraphs
- Sur la cardinalite maximum des couplages d'hypergraphes aléatoires uniformes
- A threshold for perfect matchings in random d-pure hypergraphs
- A condition for matchability in hypergraphs
- Perfect matchings in random s‐uniform hypergraphs