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 3, with a unique perfect matching. This settles a conjecture proposed by Snevily.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.