On the maximum number of edges in a hypergraph with a unique perfect matching |
| |
| Authors: | Deepak Bal Andrzej Dudek Zelealem B Yilma |
| |
| Institution: | aDepartment of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, USA;bDepartment of Mathematics, Western Michigan University, Kalamazoo, MI 49008, USA |
| |
| 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. |
| |
| Keywords: | Hypergraph Perfect matching |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
