Analysis of some statistics for increasing tree families.
Panholzer, Alois, Prodinger, Helmut (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Counting rooted trees: the universal law .”
Analysis of some statistics for increasing tree families.
Descendants in increasing trees.
Kuba, Markus, Panholzer, Alois (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Almost all trees have an even number of independent sets.
Wagner, Stephan G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Horton-Strahler number for combinatorial tries
Markus E. Nebel (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On Catalan trees and the Jacobian conjecture.
Singer, Dan (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On an identity for the cycle indices of rooted tree automorphism groups.
Wagner, Stephan G. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Branching extent and spectra of trees.
Michalski, Miłosz (1986)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
A bijective proof of Garsia's -Lagrange inversion theorem.
Singer, Dan W. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the distribution of depths in increasing trees.
Kuba, Markus, Wagner, Stephan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Probabilistic proofs of hook length formulas involving trees.
Sagan, Bruce E. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Discovering hook length formulas by an expansion technique.
Han, Guo-Niu (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on major sequences and external activity in trees.
Beissinger, Janet S., Peled, Uri N. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hook length formulas for trees by Han's expansion.
Chen, William Y.C., Gao, Oliver X.Q., Guo, Peter L. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: