Limit theorems for sizes of trees in the unlabelled graph of a random mapping

DOI10.1515/1569392041938767zbMath1103.60301OpenAlexW1988290047MaRDI QIDQ3409836

Yuriy L. Pavlov

Publication date: 20 November 2006

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/1569392041938767

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Combinatorial probability (60C05)

Related Items (4)

Limit theorems for the logarithm of the order of a random \(A\)-mapping ⋮ On conditions for emergence of a giant tree in a random unlabelled forest ⋮ On the number of \(A\)-mappings ⋮ On the number of components of fixed size in a random \(A\)-mapping

Cites Work

• Unnamed Item

This page was built for publication: Limit theorems for sizes of trees in the unlabelled graph of a random mapping