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\)

DOI10.1016/0168-0072(95)00071-2zbMath0858.03037OpenAlexW1538076976MaRDI QIDQ2564048

Saharon 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

zbMATH Keywords

random graphsfinite model theory0--1 law

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Fixed-point extensions of first-order logic
• Zero-One Laws for Sparse Random Graphs
• 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\)