On the zero-one 4-law for the Erdős-Rényi random graphs

DOI10.1134/S0001434615010216MaRDI QIDQ2353728zbMATH OpenOpenAlexFDO

Authors M. E. Zhukovskii

Publication date 16 July 2015

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0001434615010216

zbMATH Keywords

Erdős-Rényi randomgraphfirst-order propertyzero-one 4-lawzero-one \(k\)-law

Mathematics Subject Classification ID

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

Recommendations

• Universal zero-one k-law
• Zero-one \(k\)-law
• On the zero-one k-law extensions
• When does the zero-one k-law fail?
• Zero-one laws for first-order formulas with a bounded quantifier depth

Cites work

• An application of games to the completeness problem for formalized theories
• Counting extensions
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 1231233 (Why is no real title available?)
• scientific article; zbMATH DE number 641289 (Why is no real title available?)
• scientific article; zbMATH DE number 1072414 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• On the convergence of probabilities of the random graph properties expressed by first-order formulae with a bounded quantifier depth
• On the zero-one k-law extensions
• Random graphs.
• The largest critical point in the zero-one k-law
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The strange logic of random graphs
• Threshold functions for small subgraphs
• Zero-one \(k\)-law
• Zero-one laws for first-order formulas with a bounded quantifier depth
• Zero-One Laws for Sparse Random Graphs

Cited in

(8)

• Bounded quantifier depth spectra for random graphs
• Universal zero-one k-law
• On the zero-one k-law extensions
• Zero-one \(k\)-law
• First-order properties of bounded quantifier depth of very sparse random graphs
• First-order zero-one law for the uniform model of the random graph
• First-order and monadic properties of highly sparse random graphs
• Spectrum of FO logic with quantifier depth 4 is finite

This page was built for publication: On the zero-one 4-law for the Erdős-Rényi random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353728)