Counting unlabeled k-trees
Combinatorics
2015-09-14 v3
Abstract
We count unlabeled k-trees by properly coloring them in k+1 colors and then counting orbits of these colorings under the action of the symmetric group on the colors.
Keywords
Cite
@article{arxiv.1309.1429,
title = {Counting unlabeled k-trees},
author = {Andrew Gainer-Dewar and Ira M. Gessel},
journal= {arXiv preprint arXiv:1309.1429},
year = {2015}
}
Comments
Proposition 4 added in this version