Teoriâ veroâtnostej i ee primeneniâ, Tome 17 (1972) no. 2, pp. 253-265
Citer cet article
A. K. Kel'mans. Asymptotic formulas for the probability of $k$-connectedness of random graphs. Teoriâ veroâtnostej i ee primeneniâ, Tome 17 (1972) no. 2, pp. 253-265. http://geodesic.mathdoc.fr/item/TVP_1972_17_2_a3/
@article{TVP_1972_17_2_a3,
author = {A. K. Kel'mans},
title = {Asymptotic formulas for the probability of $k$-connectedness of random graphs},
journal = {Teori\^a vero\^atnostej i ee primeneni\^a},
pages = {253--265},
year = {1972},
volume = {17},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TVP_1972_17_2_a3/}
}
TY - JOUR
AU - A. K. Kel'mans
TI - Asymptotic formulas for the probability of $k$-connectedness of random graphs
JO - Teoriâ veroâtnostej i ee primeneniâ
PY - 1972
SP - 253
EP - 265
VL - 17
IS - 2
UR - http://geodesic.mathdoc.fr/item/TVP_1972_17_2_a3/
LA - ru
ID - TVP_1972_17_2_a3
ER -
%0 Journal Article
%A A. K. Kel'mans
%T Asymptotic formulas for the probability of $k$-connectedness of random graphs
%J Teoriâ veroâtnostej i ee primeneniâ
%D 1972
%P 253-265
%V 17
%N 2
%U http://geodesic.mathdoc.fr/item/TVP_1972_17_2_a3/
%G ru
%F TVP_1972_17_2_a3
For graphs with vertices of sufficiently large, in a certain sense, degrees, asymptotical formulas are derived for the probability of $k$-connectedness of vertex subsets provided the edges of graphs are removed independently with given probabilities.
