In the random graph G(n,p), p=n^-a: If has probability O(n^-) for every >0 then it has probability O(e^-n^ ) for some >0

DOI10.1016/0168-0072(95)00071-2zbMATH Open0858.03037OpenAlexW1538076976MaRDI QIDQ2564048FDOQ2564048

Authors: S. Shelah 

Publication date: 6 January 1997

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(95)00071-2

Recommendations

• When Does the Zero-One Law Hold?
• Probabilities of Sentences about Very Sparse Random Graphs
• Zero-one laws with variable probability
• Zero-one \(k\)-law
• An extension of 0‐1 laws

zbMATH Keywords

finite model theoryrandom graphs0--1 law

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Model theory of finite structures (03C13)

Cites Work

• Fixed-point extensions of first-order logic
• Zero-One Laws for Sparse Random Graphs
• Title not available (Why is that?)
• Zero-one laws for graphs with edge probabilities decaying with distance. Part I

This page was built for publication: In the random graph \(G(n,p), p=n^{-a}\): If \(\psi\) has probability \(O(n^{-\varepsilon})\) for every \(\varepsilon >0\) then it has probability \(O(e^{-n^ \varepsilon})\) for some \(\varepsilon >0\)

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