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

2011/04/15 by Deepak Bal, Bal, Deepak, Andrzej Dudek +3
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1104.3158

openalex publication_date 2011/04/15 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28

Abstract

In this note, we determine the maximum number of edges of a k-uniform\nhypergraph, k\≥ 3, with a unique perfect matching. This settles a conjecture\nproposed by Snevily.\n

Related

• On the Maximum Number of Edges in a Hypergraph with Given Matching\n Number
• Sparse hypergraphs: new bounds and constructions
• A generalization of Erdős' matching conjecture
• Perfect Matchings in 4-uniform hypergraphs
• Perfect matching in 3-uniform hypergraphs with large vertex degree