On the independence number of some random trees

DOI10.1214/20-ECP345zbMath1468.60015arXiv2003.08712MaRDI QIDQ2201542

Svante Janson

Publication date: 29 September 2020

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.08712

zbMATH Keywords

independence numberrandom treesbinary search treerandom recursive treeCrump-Mode-Jagers branching process

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On the distribution of eigenvalues of increasing trees

Cites Work

• Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees
• Asymptotic fringe distributions for general families of random trees
• Random Graphs and Complex Networks
• Analysis of three graph parameters for random trees
• Emergence of Scaling in Random Networks
• The growth and composition of branching populations
• Packing and covering constants for certain families of trees. I
• Packing and Covering Constants for Certain Families of Trees. II
• The stable doubly infinite pedigree process of supercritical branching populations
• Lectures on the Poisson Process
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the independence number of some random trees