2 research outputs found
On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching
No full textIn this note, we determine the maximum number of edges of a k-uniform hypergraph, k\u3c3, with a unique perfect matching. This settles a conjecture proposed by Snevily
On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching
Get PDFIn this note, we determine the maximum number of edges of a k-uniform hypergraph, k\u3c3, with a unique perfect matching. This settles a conjecture proposed by Snevily
