References
Yu. V. Glebskii, D. I. Kogan, M. I. Liogon’kii, and V. A. Talanov, Kibernetika, No. 2, 17–26 (1969).
R. Fagin, J. Symbolic Logic 41(1), 50–58 (1976).
S. Shelah and J. H. Spencer, J. Am. Math. Soc. 1(1), 97–115 (1988).
M. E. Zhukovskii, Vestn. Ross. Univ. Druzhby Narodov 2(1), 11–25 (2010).
M. E. Zhukovskii, Dokl. Math. 81(1), 51–54 (2010).
M. E. Zhukovskii, Probl. Peredachi Inf. 47(3), 39–57 (2011).
M. E. Zhukovskii, Sb. Math. 203(7), 1012–1044 (2012).
S. N. Popova, Probl. Peredachi Inf. 50(1), 79–101 (2014).
A. M. Raigorodskii, in Thirty Essays on Geometric Graph Theory (Springer-Verlag, Berlin, 2013), pp. 429–460.
E. E. Demekhin, A. M. Raigorodskii, and O. I. Rubanov, Sb. Math. 204(4), 508–538 (2013).
N. K. Vereshchagin and A. Shen’, Languages and Calculi (MTsNMO, Moscow, 2000) [in Russian].
N. Alon and J. H. Spencer, The Probabilistic Method (Wiley, New York, 2004; BINOM, Moscow, 2007).
A. M. Raigorodskii, Models of Random Graphs (MTsNMO, Moscow, 2011) [in Russian].
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © S.N. Popova, 2014, published in Doklady Akademii Nauk, 2014, Vol. 458, No. 1, pp. 18–21.
Rights and permissions
About this article
Cite this article
Popova, S.N. Zero-one laws for random distance graphs with vertices in {0, 1}n . Dokl. Math. 90, 535–538 (2014). https://doi.org/10.1134/S1064562414060040
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064562414060040