Maximal induced trees in sparse random graphs
- 31 December 1988
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 72 (1-3) , 257-265
- https://doi.org/10.1016/0012-365x(88)90215-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Large induced trees in sparse random graphsPublished by Elsevier ,2004
- Large holes in sparse random graphsCombinatorica, 1987
- Induced trees in sparse random graphsGraphs and Combinatorics, 1986
- On the order of the largest induced tree in a random graphDiscrete Applied Mathematics, 1986
- Trees in random graphsDiscrete Mathematics, 1983
- The largest tree in a random graphTheoretical Computer Science, 1983
- Poisson convergence and random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1982