Erdős and Renyi conjecture

Abstract

Affirming a conjecture of Erdő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.

Cited by in corpus (4)

• An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs
• Ramsey graphs induce subgraphs of quadratically many sizes
• Proof of a conjecture on induced subgraphs of Ramsey graphs
• Large cliques and independent sets all over the place