The largest critical point in the zero-one k-law

DOI10.1070/SM2015V206N04ABEH004467zbMath1316.05110OpenAlexW2270822620MaRDI QIDQ5264436

M. E. Zhukovskii

Publication date: 27 July 2015

Published in: Sbornik: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/sm2015v206n04abeh004467

zbMATH Keywords

random graphzero-one lawfirst-order propertiesEhrenfeucht gamebounded quantifier depth

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Zero-one laws (60F20) Basic properties of first-order languages and structures (03C07)

Related Items (12)

On limit points of spectra of the random graph first-order properties ⋮ Bounded quantifier depth spectra for random graphs ⋮ Strictly balanced uniform hypergraphs and generalizations of zero-one law ⋮ When does the zero-one \(k\)-law fail? ⋮ Universal zero-one \(k\)-law ⋮ Limit points of spectra for first-order properties of random hypergraphs ⋮ Monadic second-order properties of very sparse random graphs ⋮ On the spectra of first-order language properties for random graphs ⋮ First-order properties of bounded quantifier depth of very sparse random graphs ⋮ First-order and monadic properties of highly sparse random graphs ⋮ Spectrum of FO logic with quantifier depth 4 is finite ⋮ On the zero-one 4-law for the Erdős-Rényi random graphs

This page was built for publication: The largest critical point in the zero-one k-law