On the maximum degree in a random tree
From MaRDI portal
Publication:2533557
DOI10.1307/mmj/1029000098zbMath0176.22403OpenAlexW2083365919MaRDI QIDQ2533557
Publication date: 1969
Published in: Michigan Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1307/mmj/1029000098
Related Items
Maximum degree in minor-closed classes of graphs ⋮ Building Spanning Trees Quickly in Maker-Breaker Games ⋮ Concentration of maximum degree in random planar graphs ⋮ Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation ⋮ Almost all trees are almost graceful ⋮ Unions of random trees and applications ⋮ A new combinatorial representation of the additive coalescent ⋮ The Degree Sequence of Random Graphs from Subcritical Classes ⋮ Expanders Are Universal for the Class of All Spanning Trees ⋮ On random trees obtained from permutation graphs ⋮ Random graphs from a block-stable class ⋮ Tree descent polynomials: unimodality and central limit theorem ⋮ Random Trees in Random Graphs ⋮ Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger? ⋮ Unnamed Item ⋮ Graph theoretical representations of equity indices and their centrality measures ⋮ Sharp threshold for the appearance of certain spanning trees in random graphs
