Rainbow perfect matchings for 4-uniform hypergraphs

TL;DR

This paper proves that under certain density conditions, a collection of 4-uniform hypergraph subsets admits a rainbow perfect matching, extending Khan's previous results to a broader setting.

Contribution

It generalizes Khan's theorem by establishing conditions for rainbow perfect matchings in 4-uniform hypergraphs with large vertex degrees.

Findings

Existence of rainbow perfect matchings under specified degree conditions

Extension of Khan's theorem to more general hypergraph collections

Conditions ensure a set of edges covering all parts exactly once

Abstract

Let $n$ be a sufficiently large integer with $n\equiv 0\pmod 4$ and let $F_i \subseteq{[n]\choose 4}$ where $i\in [n/4]$. We show that if each vertex of $F_i$ is contained in more than ${n-1\choose 3}-{3n/4\choose 3}$ edges, then $\{F_1, \ldots ,F_{n/4}\}$ admits a rainbow matching, i.e., a set of $n/4$ edges consisting of one edge from each $F_i$. This generalizes a deep result of Khan on perfect matchings in 4-uniform hypergraphs.