A note on limits of sequences of binary trees
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a characterization of the set of possible limits and its structure as a...
Saved in:
| Main Author: | Rudolf Grübel |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2023-05-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/10968/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Alternative Proof for the Expected Number of Distinct Consecutive Patterns in a Random Permutation
by: Anant Godbole, et al.
Published: (2024-05-01) -
A logical limit law for $231$-avoiding permutations
by: Michael Albert, et al.
Published: (2024-04-01) -
Homomorphically Full Oriented Graphs
by: Thomas Bellitto, et al.
Published: (2023-10-01) -
Spanning trees for many different numbers of leaves
by: Kenta Noguchi, et al.
Published: (2024-11-01) -
A Note on Graph Burning of Path Forests
by: Ta Sheng Tan, et al.
Published: (2024-08-01)