The bridge number of arborescent links with many twigs

Abstract

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 obtaining an upper bound on the bridge number in terms of the maximal number of link components of the underlying tree, which is valid for all arborescent links.