When does the zero-one \(k\)-law fail?

DOI10.1134/S0001434616030032zbMath1352.05170OpenAlexW2408522096MaRDI QIDQ325618

A. E. Medvedeva, M. E. Zhukovskii

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

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)

Related Items (5)

Bounded quantifier depth spectra for random graphs ⋮ Strictly balanced uniform hypergraphs and generalizations of zero-one law ⋮ Disproof of the zero-one law for existential monadic properties of a sparse binomial random graph ⋮ First-order properties of bounded quantifier depth of very sparse random graphs ⋮ A disproof the Le Bars conjecture about the zero-one law for existential monadic second-order sentences

Cites Work

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

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