2 citations · 3 across the 10 of their papers we have counts for
1 paper · 2 filters
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.