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

任意图的随机嵌入中面的期望数量至多为线性

Expected number of faces in a random embedding of any graph is at most linear

Jesse Campion Loth, Bojan Mohar

AI总结:

本文证实了图的随机2-胞腔嵌入中面的期望数量存在线性上界的猜想,证明对于任意n-顶点重图,该期望至多为$n(1+H_m)$,且该上界在常数因子范围内是最佳的。

摘要:

给定图 $G$ 的随机 2-胞腔嵌入是通过在每个顶点处选择随机局部旋转得到的。我们分析了此类嵌入中面的期望数量,这等价于研究其平均亏格。1991 年,Stahl 证明了阶为 $n$ 的任意图的随机嵌入中面的期望数量至多为 $n\log(n)$。尽管存在许多面的期望数量为 $Θ(n)$ 的图族,但目前尚未发现期望数量呈超线性的图。这引出了一个猜想,即存在一个线性上界。在本文中,我们证实了该猜想,证明了对于任意 $n$-顶点重图,随机 2-胞腔嵌入中面的期望数量至多为 $n(1+H_m)$,其中 $m$ 是最大边重数,$H_m$ 表示第 $m$ 个调和数。该上界在常数因子范围内是最佳的。

英文摘要:

A random 2-cell embedding of a given graph $G$ is obtained by choosing a random local rotation around every vertex. We analyze the expected number of faces of such an embedding, which is equivalent to studying its average genus. In 1991, Stahl proved that the expected number of faces in a random embedding of an arbitrary graph of order $n$ is at most $n\log(n)$. While there are many families of graphs whose expected number of faces is $Θ(n)$, none are known where the expected number would be super-linear. This lead to the conjecture that there is a linear upper bound. In this note we confirm the conjecture by proving that for any $n$-vertex multigraph, the expected number of faces in a random 2-cell embedding is at most $n(1+H_m)$, where $m$ is the maximum edge-multiplicity and $H_m$ denotes the $m$th harmonic number. This bound is best possible up to a constant factor.

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

↑