On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching
classification
🧮 math.CO
keywords
edgeshypergraphmatchingmaximumnumberperfectuniqueconjecture
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.