On the zero-one \(k\)-law extensions

DOI10.1016/j.ejc.2016.08.009zbMath1348.05197OpenAlexW2529071052MaRDI QIDQ338576

M. E. Zhukovskii

Publication date: 7 November 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2016.08.009

zbMATH Keywords

Erdős-Rényi random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (8)

Bounded quantifier depth spectra for random graphs ⋮ Strictly balanced uniform hypergraphs and generalizations of zero-one law ⋮ Limit points of spectra for first-order properties of random hypergraphs ⋮ Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations ⋮ Quantifier alternation in first-order formulas with infinite spectra ⋮ Bounded quantifier depth spectrum for random uniform hypergraphs ⋮ Zero-one laws for \(k\)-variable first-order logic of sparse random graphs ⋮ On the zero-one 4-law for the Erdős-Rényi random graphs

Cites Work

• 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
• Succinct definitions in the first order theory of graphs
• Counting extensions
• Zero-One Laws for Sparse Random Graphs
• Threshold functions for small subgraphs
• Probabilities on finite models
• Paths in graphs
• Estimation of the number of maximal extensions in a random graph
• The strange logic of random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the zero-one \(k\)-law extensions