Abstract:
Irreducible multitours of binary trees appear in the weight formula for minimal fillings of finite metric spaces. In this paper, it is proved that the multiplicity of an irreducible multitour does not exceed 2 for any binary tree with 3 moustaches, and that it does not exceed 4 for binary trees consisting of four so-called sprouts.