Large trees in random graphs
Commentationes Mathematicae Universitatis Carolinae, Tome 28 (1987) no. 1, pp. 7-14
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{CMUC_1987_28_1_a1,
author = {Ku\v{c}era, Lud\v{e}k and R\"odl, Vojt\v{e}ch},
title = {Large trees in random graphs},
journal = {Commentationes Mathematicae Universitatis Carolinae},
pages = {7--14},
year = {1987},
volume = {28},
number = {1},
mrnumber = {889763},
zbl = {0617.05055},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMUC_1987_28_1_a1/}
}
Kučera, Luděk; Rödl, Vojtěch. Large trees in random graphs. Commentationes Mathematicae Universitatis Carolinae, Tome 28 (1987) no. 1, pp. 7-14. http://geodesic.mathdoc.fr/item/CMUC_1987_28_1_a1/
[1] H. CHERNOFF: A measure of asymptotic efficiency for test ora hypothesis based on the sum of observations. Ann. Math. Stat. 23 (1952), 493-509. | MR
[2] P. ERDÖS Z. PALKA: Trees in random graphs. Discrete Mathematics 46 (1983), 145-150. | MR
[3] P. ERDÖS J. SPENCER: Probabilistic Methods in Combinatorics. Akademiai Kiadó, Budapest 1974. | MR