On the order of the largest induced tree in a random graph
- 30 September 1986
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 15 (1) , 75-83
- https://doi.org/10.1016/0166-218x(86)90021-1
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Colouring random graphsAnnals of Operations Research, 1984
- Independent sets in random sparse graphsNetworks, 1984
- Addendum to “trees in random graphs”Discrete Mathematics, 1984
- Trees in random graphsDiscrete Mathematics, 1983
- The largest tree in a random graphTheoretical Computer Science, 1983