Erdős and Renyi conjecture
Saharon Shelah
Abstract
Affirming a conjecture of Erdős and Renyi 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| not-> (c1 log n)22) then G has at least 2c2n non-isomorphic (induced) subgraphs.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell