16 citations · 20 across the 6 of their papers we have counts for
1 paper · 1 filter
Deepak Bal, Andrzej Dudek, Zelealem B. Yilma
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.