Perfect matching and Hamilton cycle decomposition of complete balanced (k+1)-partite k-uniform hypergraphs
作者：
Highlights：
• We generalize the perfect matching (Hamilton cycle) decomposition on complete graph and complete uniform hypergraph into complete ()-parts k-uniform hypergraph .
• We prove our results using construction methods, which means that we can indeed find a perfect matching (Hamilton tight cycle) decomposition by computer in polynomial time.
• Our construction methods will use some simple number theory knowledge.
摘要
•We generalize the perfect matching (Hamilton cycle) decomposition on complete graph and complete uniform hypergraph into complete ()-parts k-uniform hypergraph .•We prove our results using construction methods, which means that we can indeed find a perfect matching (Hamilton tight cycle) decomposition by computer in polynomial time.•Our construction methods will use some simple number theory knowledge.
论文关键词：Uniform hypergraphs,Perfect matching decomposition,Hamilton tight decomposition
论文评审过程：Received 9 December 2019, Revised 24 June 2020, Accepted 28 June 2020, Available online 17 July 2020, Version of Record 17 July 2020.
论文官网地址：https://doi.org/10.1016/j.amc.2020.125492
