arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.16888math.CO
收藏

有向奥伯沃尔夫ach问题阶数为2 mod 4的完整解法,包含偶数长度的循环

A complete solution to the directed Oberwolfach problem of order $2 \pmod{4}$ with cycles of even lengths

University of New Brunswick(新不伦瑞克大学);Toronto Metropolitan University(多伦多都会大学);University of Regina(里贾纳大学)

A. C. Burgess, P. H. Danziger, A. Lacaze-Masmonteil

AI总结:

本文解决了阶数为2 mod 4的有向奥伯沃尔夫ach问题,通过偶数长度循环的有向2-因子分解提供完整解法。

摘要:

奥伯沃尔夫ach问题要求对完全图进行2-因子分解,使得每个2-因子与特定因子F同构。最近,该问题被扩展到有向图。在这种情况下,有向奥伯沃尔夫ach问题要求对完全对称有向图进行有向2-因子分解,使得每个有向2-因子与特定的有向因子F同构。在本文中,我们考虑有向奥伯沃尔夫ach问题,其中有向2-因子由偶数长度的循环组成。具体来说,我们为该特定情况提供了完整解法,当完全对称有向图的阶数模4余2时。

英文摘要:

The Oberwolfach problem asks for a $2$-factorization of the complete graph in which each $2$-factor is isomorphic to a specific factor $F$. Recently, this problem has been extended to directed graphs. In this case, the directed Oberwolfach problem asks for a directed 2-factorization of the complete symmetric digraph in which each directed $2$-factor is isomorphic to a specific directed factor $F$. In this paper, we consider the directed Oberwolfach problem with directed 2-factors comprised of cycles of even lengths. Specifically, we provide a complete solution to this particular case when the order of the complete symmetric digraph is congruent to 2 modulo 4.

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

↑