Counting unlabeled k-trees

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.

Proposition 4 added in this version

Cited by in corpus (2)

• Graph limits of random unlabelled $k$-trees
• Bijections on $r$-Shi and $r$-Catalan Arrangements