Large trees in random graphs
Commentationes Mathematicae Universitatis Carolinae (1987)
- Volume: 028, Issue: 1, page 7-14
- ISSN: 0010-2628
Access Full Article
top
How to cite
topKučera, Luděk, and Rödl, Vojtěch. "Large trees in random graphs." Commentationes Mathematicae Universitatis Carolinae 028.1 (1987): 7-14. <http://eudml.org/doc/17508>.
@article{Kučera1987,
author = {Kučera, Luděk, Rödl, Vojtěch},
journal = {Commentationes Mathematicae Universitatis Carolinae},
keywords = {induced tree; induced subgraph; random graph},
language = {eng},
number = {1},
pages = {7-14},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {Large trees in random graphs},
url = {http://eudml.org/doc/17508},
volume = {028},
year = {1987},
}
TY - JOUR
AU - Kučera, Luděk
AU - Rödl, Vojtěch
TI - Large trees in random graphs
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 1987
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 028
IS - 1
SP - 7
EP - 14
LA - eng
KW - induced tree; induced subgraph; random graph
UR - http://eudml.org/doc/17508
ER -
References
top- H. CHERNOFF, A measure of asymptotic efficiency for test ora hypothesis based on the sum of observations, Ann. Math. Stat. 23 (1952), 493-509. (1952) MR0057518
- P. ERDÖS Z. PALKA, Trees in random graphs, Discrete Mathematics 46 (1983), 145-150. (1983) MR0710885
- P. ERDÖS J. SPENCER, Probabilistic Methods in Combinatorics, Akademiai Kiadó, Budapest 1974. (1974) MR0382007
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.