Vertices of degree k in random unlabeled trees

DOI10.1002/JGT.20567zbMATH Open1242.05059OpenAlexW2110387198MaRDI QIDQ3113282FDOQ3113282

Authors: Makrand Sinha, Konstantinos Panagiotou 

Publication date: 8 February 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20567

Recommendations

• Vertices of degree \(k\) in random unlabeled trees
• The distribution of nodes of given degree in random trees
• The Distribution of Patterns in Random Trees
• Unlabeled trees: Distribution of the maximum degree
• Nodes of large degree in random trees and forests

zbMATH Keywords

degree sequencerandom treessharp concentration

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Randomized algorithms (68W20) Vertex degrees (05C07)

Cites Work

• The number of trees
• The distribution of degrees in a large random tree
• The distribution of nodes of given degree in random trees
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• An asymptotic evaluation of the cycle index of a symmetric group
• Nodes of large degree in random trees and forests
• Unlabeled trees: Distribution of the maximum degree

Cited In (10)

• Graph limits of random unlabelled k-trees
• An asymptotic analysis of labeled and unlabeled \(k\)-trees
• The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree
• Vertices with fixed outdegrees in large Galton-Watson trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Counting embeddings of rooted trees into families of rooted trees
• An asymptotic analysis of unlabeled \(k\)-trees
• Vertices of degree \(k\) in random unlabeled trees
• Asymptotic enumeration and limit laws for multisets: the subexponential case

This page was built for publication: Vertices of degree \(k\) in random unlabeled trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113282)