Foata's Bijection for Tree-Like Structures
classification
🧮 math.CO
keywords
treesbijectionfoatastructurestree-likebijectionsconstructionscycle-free
read the original abstract
We present bijections enumerating (k,m)-trees, k-gon trees, edge labelled (2,1)-trees, and other tree-like structures. Our constructions are based on Foata's (1971) bijection for cycle-free functions, which is simplified here.
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.