Erdos and Renyi conjecture

被引：19
|
作者：
Shelah, S [1 ]
机构：
[1] Hebrew Univ Jerusalem, Inst Math, IL-91904 Jerusalem, Israel
[2] Rutgers State Univ, Dept Math, New Brunswick, NJ 08903 USA
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES A | 1998年 / 82卷 / 02期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1006/jcta.1997.2845
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Affirming a conjecture of Erdos and Renyi we prove that for any (real number) c(1) > 0 for some c(2) > 0, if a graph G has no c(1) (log n) nodes on which the graph is complete or edgeless (i.e., G exemplifies \G\ negated right arrow (c(1) log n)(2)(2)), then G has at least 2(c2n)non-isomorphic (induced) subgraphs. (C) 1998 Academic Press.
引用
收藏
页码：179 / 185
页数：7
相关论文
共 50 条
12345