On the number of nearly perfect matchings in almost regular uniform hypergraphs

DOI10.1016/S0012-365X(99)00127-2zbMath0942.05049OpenAlexW2067142590WikidataQ126377344 ScholiaQ126377344MaRDI QIDQ1817560

Nikolaj Nikolaevich Kuzyurin, Armen S. Asratian

Publication date: 15 August 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00127-2

zbMATH Keywords

hypergraphperfect matchingLovász local lemma

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

On the vertex cover number of 3-uniform hypergraph

This page was built for publication: On the number of nearly perfect matchings in almost regular uniform hypergraphs