Abstract
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. © 1998 Academic Press.
Cite
CITATION STYLE
APA
Shelah, S. (1998). Erdos and Rényi Conjecture. Journal of Combinatorial Theory. Series A, 82(2), 179–185. https://doi.org/10.1006/jcta.1997.2845
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free