On the maximum degree in a random tree
From MaRDI portal
Publication:2533557
Cited in
(17)- Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?
- Unions of random trees and applications
- Tree descent polynomials: unimodality and central limit theorem
- Concentration of maximum degree in random planar graphs
- Maximum degree in minor-closed classes of graphs
- Building spanning trees quickly in maker-breaker games
- Sharp threshold for the appearance of certain spanning trees in random graphs
- The degree sequence of random graphs from subcritical classes
- Random Trees in Random Graphs
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- A new combinatorial representation of the additive coalescent
- Expanders Are Universal for the Class of All Spanning Trees
- Graph theoretical representations of equity indices and their centrality measures
- Almost all trees are almost graceful
- Expanders are universal for the class of all spanning trees
- On random trees obtained from permutation graphs
- Random graphs from a block-stable class
This page was built for publication: On the maximum degree in a random tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2533557)
