A condition for matchability in hypergraphs
A complete matching in a hypergraph is a partition of the vertex set into pairwise disjoint edges. An analog of Hall's theorem about complete matchings in certain hypergraphs is proved.
scientific article; zbMATH DE number 811344