The number of trees
From MaRDI portal
Publication:2647861
DOI10.2307/1969046zbMath0032.12601OpenAlexW2319000796WikidataQ115032125 ScholiaQ115032125MaRDI QIDQ2647861
Publication date: 1948
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/62ff7928add423af8e1f34a8518d3821a2ac77d1
Related Items (only showing first 100 items - show all)
The Number of Locally Restricted Directed Graphs ⋮ Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers ⋮ The Dissimilarity Characteristic of Linear Graphs ⋮ The distribution of height and diameter in random non-plane binary trees ⋮ The Number of Linear, Directed, Rooted, and Connected Graphs ⋮ Subexponential Time Algorithms for Finding Small Tree and Path Decompositions ⋮ Packing and Covering Constants for Certain Families of Trees. II ⋮ The number of plane trees with a given partition ⋮ The enumeration of tree-like polyhexes ⋮ Unnamed Item ⋮ Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem ⋮ Determination of Glycan Structure from Tandem Mass Spectra ⋮ Asymptotic properties of random unlabelled block-weighted graphs ⋮ Aligning random graphs with a sub-tree similarity message-passing algorithm ⋮ The Harmonious Chromatic Number of Almost All Trees ⋮ On fully diverse sets of geometric objects and graphs ⋮ Doubly random polytopes ⋮ The distributions under two species-tree models of the total number of ancestral configurations for matching gene trees and species trees ⋮ Testing correlation of unlabeled random graphs ⋮ A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ A Uniform Approach Towards Succinct Representation of Trees ⋮ The regularity of almost all edge ideals ⋮ Central Limit Theorems for Additive Tree Parameters with Small Toll Functions ⋮ An improved algorithm for finding minimum-risk 3-state-device networks ⋮ Unnamed Item ⋮ Parameterized complexity of categorical clustering with size constraints ⋮ Enumerating tree-like polyphenyl isomers ⋮ The scaling of the minimum sum of edge lengths in uniformly random trees ⋮ Emergent network modularity ⋮ Counting finite models ⋮ A Recurrent Enumeration of Free Hypermultisets ⋮ Almost Every Tree With m Edges Decomposes K2m,2m ⋮ On the combinatorics of leftist trees ⋮ On conditions for emergence of a giant tree in a random unlabelled forest ⋮ Enumerating Membrane Structures ⋮ Degree-Constrained Subgraph Problems: Hardness and Approximation Results ⋮ Validated computation of the local truncation error of Runge–Kutta methods with automatic differentiation ⋮ The CRT is the scaling limit of unordered binary trees ⋮ The Distribution of Patterns in Random Trees ⋮ Random unlabelled graphs containing few disjoint cycles ⋮ HOW TO COUNT TREES? ⋮ Recursion and growth estimates in renormalizable quantum field theory ⋮ The unlabelled speed of a hereditary graph property ⋮ Simplicial quantum gravity in the elongated phase ⋮ Path node-covering constants for certain families of trees ⋮ Generating formulas for the number of trees in a graph ⋮ The probability that a point of a tree is fixed ⋮ Climbing certain types of rooted trees. II ⋮ An application of graphical enumeration to PA * ⋮ Equiseparability on Terminal Wiener Index ⋮ Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits ⋮ On bases of the set of graphs with given coefficient of internal stability ⋮ Isomorphism and Symmetries in Random Phylogenetic Trees ⋮ Graph limits of random unlabelled k-trees ⋮ On the probability of planarity of a random graph near the critical point ⋮ Vertices of degree k in random unlabeled trees ⋮ Dissimilarity Characteristic Theorems for Graphs ⋮ Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results ⋮ Vertices of Degree k in Random Unlabeled Trees ⋮ Topological and analytical classification of vector fields with only isochronous centres ⋮ Fast Generation of Unlabelled Free Trees using Weight Sequences ⋮ Efficient dominating sets in labeled rooted oriented trees ⋮ On acyclic simplicial complexes ⋮ On the Rigidity of Sparse Random Graphs ⋮ Is the formal energy of the mid-point rule convergent? ⋮ Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere ⋮ The number of trees with a 1-factor ⋮ Parameterizing role coloring on forests ⋮ Parameterized complexity of categorical clustering with size constraints ⋮ A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) ⋮ Graphs, partitions and Fibonacci numbers ⋮ Enumeration of binary trees compatible with a perfect phylogeny ⋮ An asymptotic analysis of labeled and unlabeled \(k\)-trees ⋮ Nonlinear analysis of a simple model of temperature evolution in a satellite ⋮ On the OBDD representation of some graph classes ⋮ Enumeration of algebras close to absolutely free algebras and binary trees ⋮ A logical approach to asymptotic combinatorics I. First order properties ⋮ A note on the number of leftist trees ⋮ Limit theorem concerning random mapping patterns ⋮ A degree bound for strongly nilpotent polynomial automorphisms ⋮ Asymptotics of combinatorial structures with large smallest component ⋮ The expected number of symmetries in locally restricted trees. II ⋮ Algorithmic Pirogov-Sinai theory ⋮ An explicit formula enumerating the finely bounded trees using Young tableaux ⋮ Energy-preserving integrators and the structure of B-series ⋮ Largest component in random combinatorial structures ⋮ Model spaces of regularity structures for space-fractional SPDEs ⋮ Enumeration of (uni- or bicolored) plane trees according to their degree distribution ⋮ Scaling limits of random Pólya trees ⋮ On extreme \(U_1\) matrices ⋮ Random walks on quasirandom graphs ⋮ The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree ⋮ On the Wiener index of random trees ⋮ Counting graceful labelings of trees: a theoretical and empirical study ⋮ On the shape of random Pólya structures ⋮ Equiseparability on terminal Wiener index ⋮ Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation ⋮ The degree profile of random Pólya trees ⋮ The number of rooted trees of given depth
This page was built for publication: The number of trees
