A remark on the enumeration of rooted labeled trees
From MaRDI portal
(Redirected from Publication:2182187)
Abstract: Two decades ago, Chauve, Dulucq and Guibert showed that the number of rooted trees on the vertex set in which exactly children of the root are lower-numbered than the root is . Here I give a simpler proof of this result.
Recommendations
Cites work
- A new proof of Cayley's formula for counting labeled trees
- A note on Abel polynomials and rooted labeled forests
- A Ramanujan sequence that refines the Cayley formula for trees
- A recursive algorithm for trees and forests
- An exposá of the mullin-rota theory of polynomials of binomial type
- Cayley′s Formula: A Page From The Book
- Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions
- Forests of labeled trees
- scientific article; zbMATH DE number 3851501 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 1504579 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- scientific article; zbMATH DE number 3409479 (Why is no real title available?)
- scientific article; zbMATH DE number 3414311 (Why is no real title available?)
- On Cayley's Formula for Counting Trees
- Preuves combinatoires des identites d'Abel
- Proofs from THE BOOK. Including illustrations by Karl H. Hofmann
- Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
Cited in
(24)- Labelled and unlabelled enumeration of k-gonal 2-trees
- The number of rooted trees of given depth
- An explicit formula enumerating the finely bounded trees using Young tableaux
- Enumerations of vertices among all rooted ordered trees with levels and degrees
- A generalized enumeration of labeled trees and reverse Prüfer algorithm
- A formula for the number of labelled trees
- Counting special families of labelled trees
- On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees
- Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees
- scientific article; zbMATH DE number 6385357 (Why is no real title available?)
- scientific article; zbMATH DE number 4134081 (Why is no real title available?)
- Bijections on rooted trees with fixed size of maximal decreasing subtrees
- scientific article; zbMATH DE number 4104976 (Why is no real title available?)
- Refined enumeration of vertices among all rooted ordered \(d\)-trees
- scientific article; zbMATH DE number 971754 (Why is no real title available?)
- scientific article; zbMATH DE number 4187815 (Why is no real title available?)
- A counting formula for labeled, rooted forests
- The \(\mathbb{DL}(P)\) vector space of pencils for singular matrix polynomials
- On the enumeration of rooted trees with fixed size of maximal decreasing trees
- Two short proofs of Kemp's identity for rooted plane trees
- A refinement of Cayley's formula for trees
- Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices
- \(\alpha\)-labeling number of trees
- On an identity for the cycle indices of rooted tree automorphism groups
This page was built for publication: A remark on the enumeration of rooted labeled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2182187)
