论文标题
带有许多树枝的树木链接的桥梁数
The bridge number of arborescent links with many twigs
论文作者
论文摘要
我们证明了与面积与以下特性相关的树木链路的子午秩猜想：所有分支点都带有直接的分支，至少三片叶子。证明涉及桥梁数量上的上限，这是基础树的最大链接组件数，对所有树木链接有效。
We prove the meridional rank conjecture for arborescent links associated to plane trees with the following property: all branching points carry a straight branch to at least three leaves. The proof involves an upper bound on the bridge number in terms of the maximal number of link components of the underlying tree, valid for all arborescent links.
