Erd\H{o}s and Renyi conjecture
组合数学
2016-09-07 v1 逻辑
摘要
Affirming a conjecture of Erd\H{o}s 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| not-> (c_1 log n)^2_2) then G has at least 2^{c_2n} non-isomorphic (induced) subgraphs.
引用
@article{arxiv.math/9707226,
title = {Erd\H{o}s and Renyi conjecture},
author = {Saharon Shelah},
journal= {arXiv preprint arXiv:math/9707226},
year = {2016}
}