Title of article :
On the maximum number of edges in a hypergraph with a unique perfect matching
Author/Authors :
Bal، نويسنده , , Deepak and Dudek، نويسنده , , Andrzej and Yilma، نويسنده , , Zelealem B.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2011
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 :
Perfect matching , Hypergraph
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
