Erdos and Rényi Conjecture

Saharon Shelah

doi:10.1006/jcta.1997.2845

Erdos and Rényi Conjecture

Saharon Shelah^*

^*Corresponding author for this work

Einstein Institute of Mathematics

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

17 Scopus citations

Abstract

Affirming a conjecture of Erdos and Rényi we prove that for any (real number)c₁>0 for some c₂>0, if a graph G has no c₁(log n) nodes on which the graph is complete or edgeless (i.e.,G exemplifies G(c₁log n)²₂), then G has at least 2^c2nnon-isomorphic (induced) subgraphs.

Original language	English
Pages (from-to)	179-185
Number of pages	7
Journal	Journal of Combinatorial Theory. Series A
Volume	82
Issue number	2
DOIs	https://doi.org/10.1006/jcta.1997.2845
State	Published - May 1998

Access to Document

10.1006/jcta.1997.2845

Cite this

@article{0ae3787ebf5a4c7cab4d9c7b846141dc,

title = "Erdos and R{\'e}nyi Conjecture",

abstract = "Affirming a conjecture of Erdos and R{\'e}nyi we prove that for any (real number)c1>0 for some c2>0, if a graph G has no c1(log n) nodes on which the graph is complete or edgeless (i.e.,G exemplifies G(c1log n)22), then G has at least 2c2nnon-isomorphic (induced) subgraphs.",

author = "Saharon Shelah",

year = "1998",

month = may,

doi = "10.1006/jcta.1997.2845",

language = "אנגלית",

volume = "82",

pages = "179--185",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - Erdos and Rényi Conjecture

AU - Shelah, Saharon

PY - 1998/5

Y1 - 1998/5

N2 - Affirming a conjecture of Erdos and Rényi we prove that for any (real number)c1>0 for some c2>0, if a graph G has no c1(log n) nodes on which the graph is complete or edgeless (i.e.,G exemplifies G(c1log n)22), then G has at least 2c2nnon-isomorphic (induced) subgraphs.

AB - Affirming a conjecture of Erdos and Rényi we prove that for any (real number)c1>0 for some c2>0, if a graph G has no c1(log n) nodes on which the graph is complete or edgeless (i.e.,G exemplifies G(c1log n)22), then G has at least 2c2nnon-isomorphic (induced) subgraphs.

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

U2 - 10.1006/jcta.1997.2845

DO - 10.1006/jcta.1997.2845

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

AN - SCOPUS:0040682164

SN - 0097-3165

VL - 82

SP - 179

EP - 185

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

IS - 2

ER -

Erdos and Rényi Conjecture

Abstract

Access to Document

Other files and links

Fingerprint

Cite this