On the zero-one k-law extensions

DOI10.1016/J.EJC.2016.08.009zbMATH Open1348.05197OpenAlexW2529071052MaRDI QIDQ338576FDOQ338576

Authors: 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

Recommendations

• Zero-one \(k\)-law
• On the zero-one 4-law for the Erdős-Rényi random graphs
• Universal zero-one \(k\)-law
• When does the zero-one \(k\)-law fail?
• Zero-one laws for first-order formulas with a bounded quantifier depth

zbMATH Keywords

Erdős-Rényi random graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Probabilities on finite models
• The strange logic of random graphs
• Counting extensions
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Zero-One Laws for Sparse Random Graphs
• Threshold functions for small subgraphs
• Zero-one \(k\)-law
• Title not available (Why is that?)
• Title not available (Why is that?)
• Paths in graphs
• Zero-one laws for first-order formulas with a bounded quantifier depth
• Succinct definitions in the first order theory of graphs
• On the convergence of probabilities of the random graph properties expressed by first-order formulae with a bounded quantifier depth
• Estimation of the number of maximal extensions in a random graph

Cited In (15)

• Bounded quantifier depth spectra for random graphs
• When does the zero-one \(k\)-law fail?
• Zero-one \(k\)-law
• Bounded quantifier depth spectrum for random uniform hypergraphs
• Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations
• Strictly balanced uniform hypergraphs and generalizations of zero-one law
• On the zero-one 4-law for the Erdős-Rényi random graphs
• Title not available (Why is that?)
• Estimation of the number of maximal extensions in a random graph
• Zero-one law for an extension of first-order predicate language
• Universal zero-one \(k\)-law
• Limit points of spectra for first-order properties of random hypergraphs
• Quantifier alternation in first-order formulas with infinite spectra
• First-order zero-one law for the uniform model of the random graph
• Zero-one laws for \(k\)-variable first-order logic of sparse random graphs

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

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