On the maximum number of edges in a hypergraph with a unique perfect matching

DOI10.1016/J.DISC.2011.07.016zbMATH Open1238.05181arXiv1104.3158OpenAlexW2030828012MaRDI QIDQ409380FDOQ409380

Authors: Deepak Bal, Zelealem B. Yilma, Andrzej Dudek 

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: In this note, we determine the maximum number of edges of a $k$-uniform hypergraph, $kge3$, with a unique perfect matching. This settles a conjecture proposed by Snevily.

Full work available at URL: https://arxiv.org/abs/1104.3158

zbMATH Keywords

hypergraphperfect matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Matching theory
• On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.
• On the structure of factorizable graphs. II

Cited In (2)

• On graphs with a unique perfect matching
• Spectral radius and \([a,b]\)-factors in graphs

This page was built for publication: On the maximum number of edges in a hypergraph with a unique perfect matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409380)