When does the zero-one k-law fail?

DOI10.1134/S0001434616030032zbMATH Open1352.05170OpenAlexW2408522096MaRDI QIDQ325618FDOQ325618

Authors: M. E. Zhukovskii, A. E. Medvedeva 

Publication date: 18 October 2016

Published in: Mathematical Notes (Search for Journal in Brave)

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

Recommendations

• When Does the Zero-One Law Hold?
• Zero-one \(k\)-law
• On failure of 0-1 laws
• Extension of the zero-one \(k\)-law
• Universal zero-one \(k\)-law
• scientific article; zbMATH DE number 3967572
• On the zero-one \(k\)-law extensions
• The generality of the zero-one laws
• scientific article; zbMATH DE number 58300
• The failure of \(R_{0}\)

zbMATH Keywords

random graphszero-one lawfirst-order formulae of depth \(k\)zero-one \(k\)-law

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Probabilities on finite models
• Zero-One Laws for Sparse Random Graphs
• Threshold functions for small subgraphs
• Extension of the zero-one \(k\)-law
• Zero-one \(k\)-law
• Random graphs: models and asymptotic characteristics
• The largest critical point in the zero-one k-law
• Zero-one laws for first-order formulas with a bounded quantifier depth
• Title not available (Why is that?)

Cited In (17)

• Bounded quantifier depth spectra for random graphs
• On the zero-one \(k\)-law extensions
• Zero-one laws for existential first-order sentences of bounded quantifier depth
• Zero-one \(k\)-law
• A disproof the Le Bars conjecture about the zero-one law for existential monadic second-order sentences
• Zero-one laws for sentences with \(k\) variables
• Strictly balanced uniform hypergraphs and generalizations of zero-one law
• Zero-one laws for random \(k\)-partite graphs
• When Does the Zero-One Law Hold?
• On the zero-one 4-law for the Erdős-Rényi random graphs
• First-order properties of bounded quantifier depth of very sparse random graphs
• On failure of 0-1 laws
• Failure of 0-1 law for sparse random graph in strong logics (Sh1062)
• First-order zero-one law for the uniform model of the random graph
• First-order and monadic properties of highly sparse random graphs
• Disproof of the zero-one law for existential monadic properties of a sparse binomial random graph
• Zero-one laws for \(k\)-variable first-order logic of sparse random graphs

This page was built for publication: When does the zero-one \(k\)-law fail?

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