A remark on the enumeration of rooted labeled trees
Abstract
Two decades ago, Chauve, Dulucq and Guibert showed that the number of rooted trees on the vertex set [n+1] in which exactly k children of the root are lower-numbered than the root is nk \, nn-k. Here I give a simpler proof of this result.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.