Erdős and Renyi conjecture

Details Erdős and Renyi conjecture Erdős and Renyi conjecture

1997-07-15

arxiv.org/abs/math/9707226v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Erdős and Renyi conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Erdős and Renyi conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Erdős and Renyi conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-399683