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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.