On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching
Abstract
In this note, we determine the maximum number of edges of a $k$-uniform hypergraph, $k\ge 3$, with a unique perfect matching. This settles a conjecture proposed by Snevily.
- Publication:
-
arXiv e-prints
- Pub Date:
- April 2011
- DOI:
- 10.48550/arXiv.1104.3158
- arXiv:
- arXiv:1104.3158
- Bibcode:
- 2011arXiv1104.3158B
- Keywords:
-
- Mathematics - Combinatorics
- E-Print:
- 5 pages