On embedding random graphs into distance graphs and graphs of diameters in Euclidean spaces

In this paper we consider the problem of finding the probability threshold for the realization of a random graph by geometric graphs in the space ${\mathbb R}^d$. In the case of graphs of diameters we prove asymptotic behavior for the threshold probability on the plane, as well as the exact expression in the case $d \ge 3$.
Bibliography: 18 titles.