On the numbers of 1-factors and 1-factorizations of hypergraphs

Anna Taranenko

A 1-factor of a hypergraph $G=(X,W)$ is a set of hyperedges such that every vertex of $G$ is incident to exactly one hyperedge from the set. A 1-factorization is a partition of all…