scientific article

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199612)9:4<351::AID-RSA1>3.0.CO;2-W" /><351::AID-RSA1>3.0.CO;2-W 10.1002/(SICI)1098-2418(199612)9:4<351::AID-RSA1>3.0.CO;2-WzbMath0881.05114arXivmath/9606230MaRDI QIDQ3123117

Saharon Shelah

Publication date: 19 November 1997

Full work available at URL: https://arxiv.org/abs/math/9606230

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convergenceprobabilityrandom graphsBoolean functionsweak zero-one law

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Formal languages and automata (68Q45) Zero-one laws (60F20)

Related Items (1)

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

This page was built for publication: