完全几何图的平面生成树和路的填充
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs
摘要:
我们考虑以下问题:在平面上一般位置的$n$点的任意集合$S$上的完全几何图$GK_n$中,包含多少个边不相交的平面生成树?我们表明,这个数字是在$Ω(\sqrt{n})$。此外,我们考虑这个问题的变种,通过限制树的直径和度(特别是考虑生成路径)。
英文摘要:
We consider the following question: How many edge-disjoint plane spanning trees are contained in a complete geometric graph $GK_n$ on any set $S$ of $n$ points in general position in the plane? We show that this number is in $Ω(\sqrt{n})$. Further, we consider variants of this problem by bounding the diameter and the degree of the trees (in particular considering spanning paths).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。