Abstract
A random graph is said to obey the (monadic) zero–one k-law if, for any property expressed by a first-order formula (a second-order monadic formula) with a quantifier depth of at most k, the probability of the graph having this property tends to either zero or one. It is well known that the random graph G(n, n –α) obeys the (monadic) zero–one k-law for any k ∈ ℕ and any rational α > 1 other than 1 + 1/m (for any positive integer m). It is also well known that the random graph does not obey both k-laws for the other rational positive α and sufficiently large k. In this paper, we obtain lower and upper bounds on the largest at which both zero–one k-laws hold for α = 1 + 1/m.
Similar content being viewed by others
References
N. K. Vereshchagin and A. Shen’, Languages and Calculi (MNTsMO, Moscow, 2000) [in Russian].
H.-D. Ebbinghaus and J. Flum, Finite Model Theory, 2nd ed. (Springer, Berlin, 1999).
M. E. Zhukovskii and A. M. Raigorodskii, Russ. Math. Surv. 70 (1), 33–81 (2015).
O. Pikhurko, J. H. Spencer, and O. Verbitsky, Ann. Pure Appl. Logic 139, 74–109 (2006).
P. Heinig, T. Muller, M. Noy, and A. Taraz, 2014. arXiv:1401.7021v2.
K. J. Compton, J. Combin. Theory. Ser. A 50, 110–131 (1989).
S. Janson, T. Luczak, and A. Rucinski, Random Graphs (Wiley, New York, 2000).
B. Bollobás, Random Graphs, 2nd ed. (Cambridge Univ. Press, Cambridge, 2001).
S. Shelah and J. H. Spencer, J. Am. Math. Soc. 1, 97–115 (1988).
J. Tyszkiewicz, Lect. Notes Comput. Sci. 702, 425–439 (1993).
M. E. Zhukovskii, Dokl. Math. 83 (1), 8–11 (2011).
M. E. Zhukovskii, Discrete Math. 312, 1670–1688 (2012).
M. E. Zhukovskii, Dokl. Math. 89 (1), 16–19 (2014).
M. E. Zhukovskii, Sb. Math. 206 (4), 489–509 (2015).
M. E. Zhukovskii, Math. Notes 97 (2), 190–200 (2015).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © M.E. Zhukovskii, L.B. Ostrovskii, 2016, published in Doklady Akademii Nauk, 2016, Vol. 470, No. 5, pp. 499–501.
Rights and permissions
About this article
Cite this article
Zhukovskii, M.E., Ostrovskii, L.B. First-order and monadic properties of highly sparse random graphs. Dokl. Math. 94, 555–557 (2016). https://doi.org/10.1134/S1064562416050240
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064562416050240