The following pages link to The number of trees (Q2647861):
Displaying 50 items.
- On the parity of the Wiener index (Q1024296) (← links)
- The number of trees with a 1-factor (Q1085165) (← links)
- A logical approach to asymptotic combinatorics I. First order properties (Q1103939) (← links)
- A note on the number of leftist trees (Q1108029) (← links)
- Limit theorem concerning random mapping patterns (Q1110176) (← links)
- The enumeration of stack polytopes and simplicial clusters (Q1173286) (← links)
- Counting asymmetric enriched trees (Q1199819) (← links)
- Significance of the length of the shortest tree (Q1203102) (← links)
- The distribution of degrees in a large random tree (Q1218434) (← links)
- Modular graphs (Q1232419) (← links)
- Asymptotic formulas for the enumerator of trees with a given number of hanging or internal vertices (Q1249192) (← links)
- Counting Witt rings (Q1270084) (← links)
- Arithmetical semigroups related to trees and polyhedra (Q1284470) (← links)
- Large deviations of combinatorial distributions. II: Local limit theorems (Q1296622) (← links)
- Largest component in random combinatorial structures (Q1381824) (← links)
- The number of trees half of whose vertices are leaves and asymptotic enumeration of plane real algebraic curves. (Q1427013) (← links)
- On the shape of random Pólya structures (Q1699530) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- On the number of unary-binary tree-like structures with restrictions on the unary height (Q1745901) (← links)
- Random combinatorial structures: the convergent case (Q1770433) (← links)
- Asymptotic number of symmetries in locally restricted trees (Q1812763) (← links)
- On an asymptotic method in enumeration (Q1824618) (← links)
- Labelled and unlabelled enumeration of \(k\)-gonal 2-trees (Q1826940) (← links)
- Counting bridgeless graphs (Q1836672) (← links)
- On monotone functions of tree structures (Q1837700) (← links)
- Is the formal energy of the mid-point rule convergent? (Q1876485) (← links)
- The expected number of symmetries in locally restricted trees. II (Q1917292) (← links)
- Enumeration of (uni- or bicolored) plane trees according to their degree distribution (Q1924370) (← links)
- The number of rooted trees of given depth (Q1953527) (← links)
- An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees (Q1970021) (← links)
- Cut-off for sandpiles on tiling graphs (Q2039415) (← links)
- Hilbert series in the category of trees with contractions (Q2043099) (← links)
- Counting embeddings of rooted trees into families of rooted trees (Q2088692) (← links)
- Distinct fringe subtrees in random trees (Q2105315) (← links)
- Enumeration of binary trees compatible with a perfect phylogeny (Q2140024) (← links)
- A degree bound for strongly nilpotent polynomial automorphisms (Q2161148) (← links)
- Algorithmic Pirogov-Sinai theory (Q2174663) (← links)
- An explicit formula enumerating the finely bounded trees using Young tableaux (Q2175793) (← links)
- Brown's theorem and its application for enumeration of dissections and planar trees (Q2256111) (← links)
- The Lie algebra of classical mechanics (Q2297869) (← links)
- Diameters of Cayley graphs generated by transposition trees (Q2341766) (← links)
- A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) (Q2370371) (← links)
- Graphs, partitions and Fibonacci numbers (Q2370416) (← links)
- Nonlinear analysis of a simple model of temperature evolution in a satellite (Q2380614) (← links)
- Enumeration of algebras close to absolutely free algebras and binary trees (Q2386047) (← links)
- Model spaces of regularity structures for space-fractional SPDEs (Q2410293) (← links)
- Scaling limits of random Pólya trees (Q2413245) (← links)
- A uniform paradigm to succinctly encode various families of trees (Q2441590) (← links)
- Counting unlabeled \(k\)-trees (Q2452429) (← links)
- A distributional study of the path edge-covering numbers for random trees (Q2482101) (← links)
