On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching
Combinatorics
2011-07-11 v3
Abstract
In this note, we determine the maximum number of edges of a -uniform hypergraph, , with a unique perfect matching. This settles a conjecture proposed by Snevily.
Cite
@article{arxiv.1104.3158,
title = {On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching},
author = {Deepak Bal and Andrzej Dudek and Zelealem B. Yilma},
journal= {arXiv preprint arXiv:1104.3158},
year = {2011}
}
Comments
5 pages