Given with for , let denote the non-uniform complete hypergraph on vertices, whose edge set contains copies of every -subset of vertex set for . Let denote for for . Recently, He et al. determined all such that has a 1-factorization. In this manuscript, we consider the 1-factorization of and obtain the following results. (1) If for and , then has a 1-factorization for sufficiently large . (2) If has a 1-factorization for sufficiently large , then .

中文翻译：

---

关于非均匀完全超图的一因式分解的注记


给定 for ，让 表示顶点上的非均匀完全超图，其边集包含顶点集的每个子集的副本。让 表示 为 。最近，何等人。确定了所有具有 1 因式分解的元素。在这篇手稿中，我们考虑 1 因式分解并获得以下结果。 (1) 如果 和 ，则 1 因式分解足够大。 (2) 如果 1 因式分解足够大，则 。