On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching

Authors

Deepak Bal, Montclair State UniversityFollow
Andrzej Dudek, Carnegie Mellon University
Zelealem B. Yilma, Carnegie Mellon University

Document Type

Article

Publication Date

11-6-2011

Journal / Book Title

Discrete Mathematics

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.

Comments

This article is Open Access under an Elsevier User License.

DOI

10.1016/j.disc.2011.07.016

MSU Digital Commons Citation

Bal, Deepak; Dudek, Andrzej; and Yilma, Zelealem B., "On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching" (2011). Department of Mathematics Facuty Scholarship and Creative Works. 125.
https://digitalcommons.montclair.edu/mathsci-facpubs/125

Published Citation

Bal, D., Dudek, A., & Yilma, Z. B. (2011). On the maximum number of edges in a hypergraph with a unique perfect matching. Discrete mathematics, 311(21), 2577-2580.