Abstract
A k-spectrum is a set of all positive α such that the random binomial graph \(G(n,{{n}^{{ - \alpha }}})\) does not obey the zero–one law for first-order formulas with a quantifier depth at most k. We have proved that the minimal k such that the k-spectrum is infinite equals 5.
Similar content being viewed by others
REFERENCES
N. K. Vereshchagin and A. Shen’, Languages and Calculi (MNTsMO, Moscow, 2012) [in Russian].
Yu. V. Glebskii, D. I. Kogan, M. I. Liagonkii, and V. A. Talanov, Kibernetika 2, 17–26 (1969).
R. Fagin, J. Symbol. Logic 41, 50–58 (1976).
J. H. Spencer, The Strange Logic of Random Graphs (Springer, Berlin, 2001).
J. H. Spencer, Discrete Appl. Math. 30, 235–252 (1991).
A. Ehrenfeucht, Warszawa Fund. Math. 49, 121–149 (1960).
N. Alon and J. H. Spencer, Probabilistic Method (Wiley, New York, 2008).
S. Janson, T. Łuczak, and A. Ruciński, Random Graphs (Wiley, New York, 2000).
S. Shelah and J. H. Spencer, J. Am. Math. Soc. 1, 97–115 (1988).
M. E. Zhukovskii, Discrete Math. 312, 1670–1688 (2012).
L. B. Ostrovsky and M. E. Zhukovskii, Ann. Pure Appl. Logic 168 (11), 2087–2101 (2017).
J. H. Spencer, Combinatorica 10 (1), 95–102 (1990).
M. Zhukovskii, Moscow J. Comb. Number Theory 6 (4), 73–102 (2016).
A. D. Matushkin and M. E. Zhukovskii, Discrete Appl. Math. 236, 329–346 (2018).
Funding
This work was supported by the Russian Foundation for Basic Research, project no. 20-31-70025.
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
The authors declare that they have no conflicts of interest.
Additional information
Translated by I. Ruzanova
Rights and permissions
About this article
Cite this article
Zhukovskii, M.E., Matushkin, A.D. & Yarovikov, Y.N. On the 4-Spectrum of First-Order Properties of Random Graphs. Dokl. Math. 104, 247–249 (2021). https://doi.org/10.1134/S1064562421050185
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064562421050185