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

次交叉数在任意割集上是可加的

Minor crossing number is additive over arbitrary cuts

Drago Bokal, Markus Chimani, Jesús Leaños

摘要:

本文证明了:如果$G$是一个最小边割$F$为3的图,且$G_1$,$G_2$是$G-F$的两个(增广)分支,则$G$的交叉数等于$G_1$和$G_2$的交叉数之和.结合已知结果,这意味着对于$d\in\{0, 1, 2, 3\}$,交叉数在$d$大小的边割上是可加的,而对于每个$d\ge 4$都有反例.该技术推广到表明,次要的交叉数是可加的任意大小的边割,以及提供边界的交叉数可加性在任意表面。指出了交叉数的精确计算和交叉临界图的几个应用,并给出了任意图与树的笛卡儿积的次交叉数的一个非常一般的下界.

英文摘要:

We prove that if $G$ is a graph with an minimal edge cut $F$ of size three and $G_1$, $G_2$ are the two (augmented) components of $G-F$, then the crossing number of $G$ is equal to the sum of crossing numbers of $G_1$ and $G_2$. Combining with known results, this implies that crossing number is additive over edge-cuts of size $d$ for $d\in\{0, 1, 2, 3\}$, whereas there are counterexamples for every $d\ge 4$. The techniques generalize to show that minor crossing number is additive over edge cuts of arbitrary size, as well as to provide bounds for crossing number additivity in arbitrary surfaces. We point out several applications to exact crossing number computation and crossing critical graphs, as well as provide a very general lower bound for the minor crossing number of the Cartesian product of an arbitrary graph with a tree.

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

↑