On the size of a maximal induced tree in a random graph
Mathematica slovaca, Tome 30 (1980) no. 2, pp. 151-155
@article{MASLO_1980_30_2_a6,
author = {Karo\'nski, Micha{\l} and Palka, Zbigniew},
title = {On the size of a maximal induced tree in a random graph},
journal = {Mathematica slovaca},
pages = {151--155},
year = {1980},
volume = {30},
number = {2},
mrnumber = {587240},
zbl = {0438.05028},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MASLO_1980_30_2_a6/}
}
Karoński, Michał; Palka, Zbigniew. On the size of a maximal induced tree in a random graph. Mathematica slovaca, Tome 30 (1980) no. 2, pp. 151-155. http://geodesic.mathdoc.fr/item/MASLO_1980_30_2_a6/
[1] BOLLOBÁS B., ERDÖS P.: Cliques in random graphs. Math. Proc. Cambridge Philos. Soc., 80, 1976, 419-427. | MR | Zbl
[2] MATULA D. W.: On the complete subgraphs of a random graph. Comb. Math, and Its Appl. Chapel Hill, N. C., 1970. | MR | Zbl
[3] MATULA D. W.: The largest clique size in a random graph. Technical Report CS 7608, 1976.