We consider a random k-tree Gn,k that is uniformly selected from the class of labelled k-trees with n + k vertices. Since 1-trees are just trees, it is well-known that Gn,1 (after ...
A cyclic urn is an urn model for balls of types 0, . . . , m − 1 where in each draw the ball drawn, say of type j, is returned to the urn together with a new ball of type j + 1 ...