A Combinatorial Identity for Rooted Labeled Forests
Combinatorics
2019-07-11 v2
Abstract
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.
Keywords
Cite
@article{arxiv.1902.06627,
title = {A Combinatorial Identity for Rooted Labeled Forests},
author = {Benjamin Hackl},
journal= {arXiv preprint arXiv:1902.06627},
year = {2019}
}