scientific article
From MaRDI portal
Publication:3271423
zbMath0093.37604MaRDI QIDQ3271423
Publication date: 1959
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Partition Functions of Discrete Coalescents: From Cayley’s Formula to Frieze’s ζ(3) Limit Theorem, On graphs with randomly deleted edges, Connectivity for bridge-alterable graph classes, On the probability of connectedness, Random spanning forests and hyperbolic symmetry, On the number of hyperforests, Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture, Parameter estimation in a 3‐parameter p‐star random graph model, Counting graceful labelings of trees: a theoretical and empirical study, Local Convergence and Stability of Tight Bridge-addable Classes, From Abel’s Binomial Theorem to Cayley’s Tree Formula, On the Length of a Random Minimum Spanning Tree, Bridge-Addability, Edge-Expansion and Connectivity, On Cayley's formula for counting forests, A generalization of the matrix-tree theorem, The longest path in a random graph, Subjectively interesting connecting trees and forests, The outer-distance of nodes in random trees, The edge correlation of random forests, Local limit theorems for one class of distributions in probabilistic combinatorics, Stories about groups and sequences, A recursive algorithm for trees and forests, Möbius coinvariants and bipartite edge-rooted forests, Asymmetric graphs, An Operator Approach to the Principle of Inclusion and Exclusion, Connectivity of addable graph classes, Random planar graphs, The distribution of degrees in a large random tree, On Operator and Formal Sum Methods for Graph Enumeration Problems, An asymptotic evaluation of the cycle index of a symmetric group, Counting forests, Distribution of nodes of a tree by degree, Applications of antilexicographic order. I: An enumerative theory of trees, Climbing random trees, Coalescent random forests, Random packings and coverings in random trees, Normal convergence problem? Two moments and a recurrence may be the clues, A Random Graph With a Subcritical Number of Edges, Limit Poisson law for the distribution of the number of components in generalized allocation scheme, The enumeration of labeled trees by degrees
