| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6423580 | Discrete Mathematics | 2011 | 4 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Deepak Bal, Andrzej Dudek, Zelealem B. Yilma,