NoteOn 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.