Runs in labelled trees and mappings
- 1 September 2020
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 343 (9)
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Austrian Science Fund (P25337-N23)
This publication has 15 references indexed in Scilit:
- Rooted forests that avoid sets of permutationsEuropean Journal of Combinatorics, 2019
- Ascents and descents in random treesJournal of Discrete Mathematical Sciences and Cryptography, 2008
- Hwang's Quasi-Power-Theorem in Dimension TwoQuaestiones Mathematicae, 2007
- A Refinement of Cayley's Formula for TreesThe Electronic Journal of Combinatorics, 2004
- Symmetries in trees and parking functionsDiscrete Mathematics, 2002
- On Convergence Rates in the Central Limit Theorems for Combinatorial StructuresEuropean Journal of Combinatorics, 1998
- On the LambertW functionAdvances in Computational Mathematics, 1996
- Bijections for Cayley trees, spanning trees, and their q-analoguesJournal of Combinatorial Theory, Series A, 1986
- Random mappings with constraints on coalescence and number of originsPacific Journal of Mathematics, 1982
- Asymptotic properties of eulerian numbersProbability Theory and Related Fields, 1972