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

DOI10.1016/J.DISC.2011.07.016MaRDI QIDQ409380zbMATHOpenAlexFDO

Authors Deepak Bal, Zelealem B. Yilma, Andrzej Dudek

Publication date 13 April 2012

Published in Discrete Mathematics (Search for Journal in Brave)

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)

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.

Cites work

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

Cited in

(2)

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

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)