The height of multiple edge plane trees

Abstract

Multi-edge trees as introduced in a recent paper of Dziemiańczuk are plane trees where multiple edges are allowed. We first show that $d$-ary multi-edge trees where the out-degrees are bounded by $d$ are in bijection with classical $d$-ary trees. This allows us to analyse parameters such as the height. The main part of this paper is concerned with multi-edge trees counted by their number of edges. The distribution of the number of vertices as well as the height are analysed asymptotically.

Cited by in corpus (5)

• Weighted unary-binary trees, Hex-trees, marked ordered trees, and related structures
• Retakh's Motzkin paths and some combinatorial comments
• The amplitude of Motzkin paths
• A walk in my lattice path garden
• Multi-edge trees and 3-coloured Motzkin paths: bijective issues