具有固定球数的覆盖几乎面嵌入图
Covering nearly surface-embedded graphs with a fixed number of balls
摘要:
Chepoi,Estellon和Vaxes [DCG '07]最近的一个结果表明,任何直径至多为2 R的平面图都可以被常数数量的大小为R的球覆盖;换句话说,存在一个常数大小的顶点子集,其中每个其他顶点的距离是直径的一半。我们将这一结果推广到图嵌入表面上的固定属与固定数量的顶点,取得进展的猜想,图不包括一个固定的未成年人也可以覆盖由一个常数数量的球。要做到这一点,我们开发了两个工具,这可能是独立的利益。第一个给出了一个边界上的图的密度上的表面上的属$g$具有限制的数量成对交叉的边缘。第二类是利用嵌入曲面图的度序列的欧几里德范数来确定不可收缩圈的大小。
英文摘要:
A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which every other vertex is distance half the diameter. We generalize this result to graphs embedded on surfaces of fixed genus with a fixed number of apices, making progress toward the conjecture that graphs excluding a fixed minor can also be covered by a constant number of balls. To do so, we develop two tools which may be of independent interest. The first gives a bound on the density of graphs drawn on a surface of genus $g$ having a limit on the number of pairwise-crossing edges. The second bounds the size of a non-contractible cycle in terms of the Euclidean norm of the degree sequence of a graph embedded on surface.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。