arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.01386cs.CGmath.CO
收藏

少边饱和简单和2-简单拓扑图

Saturated simple and 2-simple topological graphs with few edges

Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz

摘要:

简单拓扑图是任意两条边最多有一个公共点的拓扑图,该公共点要么是它们的公共端点,要么是它们的真交点。更一般地,在k-简单拓扑图中,每对边最多有k个这类公共点。我们构造了饱和简单图和2-简单图。这些是k-简单图,其中没有进一步的边缘可以添加。我们改进了Kynčl,Pach,Radoičić,和Tóth的上界,证明了n阶饱和简单图和n阶饱和2-简单图的上界,其中n阶饱和简单图的边数为7 n,n阶饱和2-简单图的边数为14.5n.因此,14.5n条边也是k-简单图的一个新的上界(考虑所有k值)。我们还构造了饱和的简单图和2-简单图,它们的顶点都是低度的。

英文摘要:

A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally, in a k-simple topological graph, every pair of edges has at most k common points of this kind. We construct saturated simple and 2-simple graphs with few edges. These are k-simple graphs in which no further edge can be added. We improve the previous upper bounds of Kynčl, Pach, Radoičić, and Tóth and show that there are saturated simple graphs on n vertices with only 7n edges and saturated 2-simple graphs on n vertices with 14.5n edges. As a consequence, 14.5n edges is also a new upper bound for k-simple graphs (considering all values of k). We also construct saturated simple and 2-simple graphs that have some vertices with low degree.

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

↑