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

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

2011-04-15

arxiv.org/abs/1104.3158v3

Mathematics

Combinatorics

5 pages

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-346286