A Combinatorial Identity for Rooted Labeled Forests
classification
🧮 math.CO
keywords
identitycombinatorialforestsrootedbriefconnectingcontextdirectly
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.