On the enumeration of leaf-labelled increasing trees with arbitrary node-degree

We consider the counting problem of the number of $\mathit{\text{leaf-labeled}}\mathit{\text{increasing}}\mathit{\text{trees}}$, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained under certain population-genetical models such as multiple-merger coalescents. While the combinatorics of the binary trees among those are well understood, for the number of all trees only an approximate asymptotic formula is known. In this work, we validate this formula up to constant terms and compare the asymptotic behavior of the number of all leaf-labelled increasing trees to that of binary, ternary and quaternary trees.