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

DOI10.1134/S0001434615010216zbMath1317.05180OpenAlexW2000899367MaRDI QIDQ2353728

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

zero-one \(k\)-lawfirst-order propertyErdős-Rényi randomgraphzero-one 4-law

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 (4)

Bounded quantifier depth spectra for random graphs ⋮ Universal zero-one \(k\)-law ⋮ First-order properties of bounded quantifier depth of very sparse random graphs ⋮ First-order and monadic properties of highly sparse random graphs

Cites Work

• On the zero-one \(k\)-law extensions
• Zero-one \(k\)-law
• On the convergence of probabilities of the random graph properties expressed by first-order formulae with a bounded quantifier depth
• Zero-one laws for first-order formulas with a bounded quantifier depth
• Counting extensions
• An application of games to the completeness problem for formalized theories
• Zero-One Laws for Sparse Random Graphs
• Threshold functions for small subgraphs
• The largest critical point in the zero-one k-law
• The strange logic of random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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