Andreas Spillner

Labeling and Folding Multi-Labeled Trees

In 1989 Erdős and Székely showed that there is a bijection between (i) the set of rooted trees with \(n+1\) vertices whose leaves are bijectively labeled with the elements of \([\ell]=\{1,2,\dots,\ell\}\) for some \(\ell \leq n\), and (ii) the set of partitions of \([n]=\{1,2,\do...