A combinatorial identity for rooted labeled forests
Benjamin Hackl · Aequationes Mathematicae · 2019
In this brief note a straightforward combinatorial proof for an identity directly connecting rooted forests and unordered set partitions is provided. Furthermore, references that put this type of identity in the context of forest volumes and multinomial identities are given.