Large induced trees in sparse random graphs
- 3 September 2004
- journal article
- Published by Elsevier
- Vol. 42 (2) , 181-195
- https://doi.org/10.1016/0095-8956(87)90039-6
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsPublished by Elsevier ,2013
- Trees in random graphsDiscrete Mathematics, 1983
- The largest tree in a random graphTheoretical Computer Science, 1983
- Long paths in sparse random graphsCombinatorica, 1982
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963