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

单纯形多胞体的边连通性

Edge connectivity of simplicial polytopes

Vincent Pilaud, Guillermo Pineda-Villavicencio, Julien Ugon

AI总结:

本文证明了单纯形多胞体图的边连通性下界,并构造达到该下界的例子,表明结果最优。

摘要:

我们证明了维数$d \ge 3$的单纯形多胞体的图没有少于$d(d+1)/2$条边的非平凡最小边割,因此该图是$\min\{\delta, d(d+1)/2\}$-边连通的,其中$\delta$表示最小度。当$d = 3$时,这意味着平面三角剖分中的每个最小边割都是平凡的。当$d \ge 4$时,我们构造了一个单纯形$d$-多胞体,其图具有基数为$d(d+1)/2$的非平凡最小边割,证明了上述结果是最优的。

英文摘要:

We show that the graph of a simplicial polytope of dimension $d \ge 3$ has no nontrivial minimum edge cut with fewer than $d(d+1)/2$ edges, hence the graph is $\min\{δ, d(d+1)/2\}$-edge-connected where $δ$ denotes the minimum degree. When $d = 3$, this implies that every minimum edge cut in a plane triangulation is trivial. When $d \ge 4$, we construct a simplicial $d$-polytope whose graph has a nontrivial minimum edge cut of cardinality $d(d+1)/2$, proving that the aforementioned result is best possible.

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

↑