| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656693 | Journal of Combinatorial Theory, Series B | 2016 | 34 Pages |
Abstract
A perfect matching in a 4-uniform hypergraph on n vertices is a subset of ⌊n4⌋ disjoint edges. We prove that if H is a sufficiently large 4-uniform hypergraph on n=4kn=4k vertices such that every vertex belongs to more than (n−13)−(3n/43) edges, then H contains a perfect matching. A construction due to Hàn, Person, and Schacht shows that this result is the best possible.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Imdadullah Khan,