曲面上图的局部证明
Local certification of graphs on surfaces
摘要:
图类$\mathcal{C}$的证明标记方案是将证书分配给类$\mathcal{C}$中的任何图的顶点,使得在读取其证书及其邻居的证书时,来自图$G\in \mathcal{C}$的每个顶点接受该实例,而如果$G\not\in \mathcal{C}$,则对于证书的每个可能分配,至少一个顶点拒绝该实例。最近证明了对于任何固定曲面$Σ$,可嵌入$Σ$中的图类都有一个证明标号方案,其中$n$ -顶点图的每个顶点接收至多$O(\log n)$位的证书.证明是相当长和复杂的,严重依赖于早期的结果可平面图。在这里,我们给任何曲面一个非常简短的证明。其主要思想是在本地编码一个旋转系统,以及一个支持通过欧拉公式进行亏格本地计算的生成树。
英文摘要:
A proof labelling scheme for a graph class $\mathcal{C}$ is an assignment of certificates to the vertices of any graph in the class $\mathcal{C}$, such that upon reading its certificate and the certificates of its neighbors, every vertex from a graph $G\in \mathcal{C}$ accepts the instance, while if $G\not\in \mathcal{C}$, for every possible assignment of certificates, at least one vertex rejects the instance. It was proved recently that for any fixed surface $Σ$, the class of graphs embeddable in $Σ$ has a proof labelling scheme in which each vertex of an $n$-vertex graph receives a certificate of at most $O(\log n)$ bits. The proof is quite long and intricate and heavily relies on an earlier result for planar graphs. Here we give a very short proof for any surface. The main idea is to encode a rotation system locally, together with a spanning tree supporting the local computation of the genus via Euler's formula.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。