On random mapping patterns

DOI10.1007/BF02579158zbMath0532.05033MaRDI QIDQ788742

A. Meir, John W. Moon

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

generating functionrooted treefunctional digraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Limit theorem concerning random mapping patterns ⋮ Largest component in random combinatorial structures ⋮ Asymptotic density in quasi-logarithmic additive number systems ⋮ Counting finite models ⋮ Gaussian limiting distributions for the number of components in combinatorial structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of functional digraphs
• A note on the number of functional digraphs
• Sur les séries de Taylor n'ayant que des singularites algebrico- logarithmiques sur leur cercle de convergence
• The number of trees
• Multisets of Aperiodic Cycles
• Probability Distributions Related to Random Mappings
• Enumeration of Linear Graphs for Mappings of Finite Sets
• The Expected Number of Components Under a Random Mapping Function
• Probability of Indecomposability of a Random Mapping Function

This page was built for publication: On random mapping patterns