Title

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

Document Type

Article

Publication Date

11-6-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.

DOI

10.1016/j.disc.2011.07.016

This document is currently not available here.

Share

COinS