加载中…
We consider edge decompositions of , the complete 3-uniform hypergraph of order minus a 1-factor (parallel class, packing of disjoint edges). We prove that a decomposition into tight 6-cycles exists if and only if (mod 12) and ; and a decomposition into tight 9-cycles exists for all divisible by 3. These results are complementary to the theorems of Akin et al. [Discrete Math. 345 (2022)] and Bunge et al. [Australas. J. Combin. 80 (2021)].

生成讲解博客的中文版本

生成AI智能校验的中文版本