
arXiv: 1101.5675
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{��}n, Person and Schacht.
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), perfect matching, Vertex degrees, Hypergraphs, vertex degree, hypergraphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Computer Science - Discrete Mathematics
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), perfect matching, Vertex degrees, Hypergraphs, vertex degree, hypergraphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Computer Science - Discrete Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 29 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
