On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching
In this note, we determine the maximum number of edges of a k-uniform hypergraph, k<3, with a unique perfect matching. This settles a conjecture proposed by Snevily.
MSU Digital Commons Citation
Bal, Deepak; Dudek, Andrzej; and Yilma, Zelealem B., "On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching" (2011). Department of Mathematics Facuty Scholarship and Creative Works. 125.