On the number of subtrees for almost all graphs

DOI10.1002/RSA.3240050119zbMath0798.05030OpenAlexW1964705576MaRDI QIDQ4288890

Ioan Tomescu

Publication date: 20 October 1994

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240050119

zbMATH Keywords

Poisson distributionrandom treeChebycheff's inequalityrandom subtrees

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Enumeration in graph theory (05C30)

Related Items (1)

Alexandrov spaces with large volume growth

This page was built for publication: On the number of subtrees for almost all graphs