arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.10081math.CO
收藏

关于具有单一 6-循环因子的 Hamilton-Waterloo 问题

On the Hamilton-Waterloo Problem with a single factor of 6-cycles

Zazil Santizo Huerta, Melissa Keranen

AI总结:

研究均匀 Hamilton-Waterloo 问题中 $\gcd(M,N)=\{2,3\}$ 且 $M=6$ 的未解案例,通过修改已知结构并开发新方法解决均匀 $2$-因子化构造挑战,扩展了已解决范围并深化了对问题复杂性的理解。

摘要:

均匀 Hamilton-Waterloo 问题 (HWP) 要求将 $K_v$ 可分解为 $α$ 个 $C_M$-因子和 $β$ 个 $C_N$-因子,即 $(C_M, C_N)$-分解。我们将均匀 Hamilton Hamilton-Waterloo 问题的解记为 $\hbox{HWP}(v; M, N; α, β)$。我们的研究集中于解决一些剩余未解决的案例,这些案例在推广上构成重大挑战。我们特别强调 $\gcd(M,N)=\{2, 3\}$ 的情况,并重点关注参数 $M=6$。我们对一些已知结构引入修改,并开发新方法来解决均匀 $2$-因子化构造中的这些突出挑战。这一创新方法不仅扩展了已解决案例的范围,也促进了对求解 Hamilton-Waterloo 问题所涉复杂性的更深刻理解。

英文摘要:

The uniform Hamilton-Waterloo Problem (HWP) asks for a resolvable $(C_M, C_N)$-decomposition of $K_v$ into $α$ $C_M$-factors and $β$ $C_N$-factors. We denote a solution to the uniform Hamilton Hamilton-Waterloo problem by $\hbox{HWP}(v; M, N; α, β)$. Our research concentrates on addressing some of the remaining unresolved cases, which pose a significant challenge to generalize. We place a particular emphasis on instances where the $\gcd(M,N)=\{2, 3\}$, with a specific focus on the parameter $M=6$. We introduce modifications to some known structures, and develop new approaches to resolving these outstanding challenges in the construction of uniform $2$-factorizations. This innovative method not only extends the scope of solved cases, but also contributes to a deeper understanding of the complexity involved in solving the Hamilton-Waterloo Problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑