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

作为手性、可定向可反与不可定向旋转地图底图的简单图的一个无限族

An infinite family of simple graphs underlying chiral, orientable reflexible and non-orientable rotary maps

Isabel Hubard, Primož Potočnik, Primož Šparl

AI总结:

本文构造字典积 $C_n[mK_1]$ 的无限族,证明其同时支撑手性、可定向可反及不可定向可反地图,解答 Wilson 的公开问题。

摘要:

本文给出了首个已知的简单图无限族,其中每个图既是一幅手性地图的骨架,又是可定向曲面上一幅可反地图的骨架,同时还是不可定向曲面上一幅可反地图的骨架。该族由所有字典积 $C_n[mK_1]$ 组成,其中 $m\ge 3$,$n=sm$,且整数 $s$ 不被 $4$ 整除。这回答了 S. Wilson 在《Families of regular graphs in regular maps》(《Journal of Combinatorial Theory, Series B》85 (2002), 269–289)中提出的一个问题。

英文摘要:

In this paper, we provide the first known infinite family of simple graphs, each of which is the skeleton of a chiral map, a skeleton of a reflexible map on an orientable surfaces, as well as a skeleton of a reflexible map on a non-orientable surface. This family consists of all lexicographic product $C_n[mK_1]$, where $m\ge 3$, $n = sm$, with $s$ an integer not divisible by $4$. This answers a question posed in [S.\ Wilson, Families of regular graphs in regular maps, {\em Journal of Combinatorial Theory, Series B} 85 (2002), 269--289].

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

↑