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.
|Number of pages||4|
|State||Published - 6 Nov 2011|
- Perfect matching