Asymptotic formulas for the probability of $k$-connectedness of random graphs

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.