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

DOI10.1016/j.disc.2011.07.016zbMath1238.05181arXiv1104.3158OpenAlexW2030828012MaRDI QIDQ409380

Zelealem B. Yilma, Deepak Bal, 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)

Related Items

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

Cites Work

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