Hereditarily finite sets and identity trees

DOI10.1016/0095-8956(83)90068-0zbMath0507.05025OpenAlexW2050075287MaRDI QIDQ1837193

Jan Mycielski, A. Meir, John W. Moon

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(83)90068-0

zbMATH Keywords

asymptotic behaviourexpected degreefamily of hereditarily finite setsrooted identity trees

Mathematics Subject Classification ID

Trees (05C05) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Combinatorial probability (60C05)

Related Items

The number of trees with a 1-factor ⋮ A shifted asymmetry index series ⋮ Some asymptotic results useful in enumeration problems ⋮ Computation of the expected number of leaves in a tree having a given automorphism, and related topics ⋮ On asymmetric structures ⋮ Counting asymmetric enriched trees ⋮ Ordinal operations on graph representations of sets ⋮ On the symmetry and asymmetry of combinatorial structures ⋮ Distributions on bicoloured binary trees arising from the principle of parsimony ⋮ The asymptotic behaviour of coefficients of powers of certain generating functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of trees in a random forest
• The number of homeomorphically irreducible trees, and other species
• Set theory. An introduction to large cardinals
• The distribution of degrees in a large random tree
• An asymptotic evaluation of the cycle index of a symmetric group
• Packing and covering constants for certain families of trees. I