Large trees in a random mapping pattern

DOI10.1006/EUJC.1993.1037MaRDI QIDQ685303zbMATH OpenOpenAlexFDO

Authors Ljuben Mutafchiev

Publication date 17 October 1993

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.1993.1037

zbMATH Keywords

large treesrandom mapping pattern

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80)

Review text

The author determines the limiting distribution of the size of the largest tree in the graph of a random mapping pattern on \(n\) unlabelled vertices; he finds that the result is the same as the corresponding result when the vertices are labelled.

Recommendations

• Limit theorems for sizes of trees in the unlabelled graph of a random mapping
• scientific article; zbMATH DE number 17682
• Limit theorems on sizes of trees in a random unlabelled forest
• Limit theorem concerning random mapping patterns
• scientific article; zbMATH DE number 4013620

Cited in

(2)

• Limit theorems for sizes of trees in the unlabelled graph of a random mapping
• scientific article; zbMATH DE number 17682 (Why is no real title available?)

This page was built for publication: Large trees in a random mapping pattern

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685303)