Perfect Matchings in 4-uniform hypergraphs

Details Perfect Matchings in 4-uniform hypergraphs Perfect Matchings in 4-uniform hypergraphs

2011-01-29

arxiv.org/abs/1101.5675v2

Computer Science

Discrete Mathematics

Scientific paper

A perfect matching in a 4-uniform hypergraph is a subset of $\lfloor\frac{n}{4}\rfloor$ disjoint edges. We prove that if $H$ is a sufficiently large 4-uniform hypergraph on $n=4k$ vertices such that every vertex belongs to more than ${n-1\choose 3} - {3n/4 \choose 3}$ edges then $H$ contains a perfect matching. This bound is tight and settles a conjecture of H{\'a}n, Person and Schacht.

Affiliated with

Also associated with

No associations

Rating

Perfect Matchings in 4-uniform hypergraphs 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 Perfect Matchings in 4-uniform hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Perfect Matchings in 4-uniform hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-573196