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

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

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	97-102
Number of pages	6
Journal	Annals of Pure and Applied Logic
Volume	82
Issue number	1
DOIs	https://doi.org/10.1016/0168-0072(95)00071-2
State	Published - Nov 1996

@article{33e503adb1e548e8a67433de4c099f74,

title = "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",

author = "Saharon Shelah",

year = "1996",

month = nov,

doi = "10.1016/0168-0072(95)00071-2",

language = "אנגלית",

volume = "82",

pages = "97--102",

journal = "Annals of Pure and Applied Logic",

issn = "0168-0072",

number = "1",

}

TY - JOUR

T1 - In the random graph G(n, p), p = n-a

T2 - If ψ has probability O(n-ε) for every ε > 0 then it has probability O(e-nε) for some ε > 0

AU - Shelah, Saharon

PY - 1996/11

Y1 - 1996/11

UR - https://www.scopus.com/pages/publications/0030295796

U2 - 10.1016/0168-0072(95)00071-2

DO - 10.1016/0168-0072(95)00071-2

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0030295796

SN - 0168-0072

VL - 82

SP - 97

EP - 102

JO - Annals of Pure and Applied Logic

JF - Annals of Pure and Applied Logic

IS - 1

ER -