Erdos and Renyi conjecture
Abstract
Affirming a conjecture of Erdos 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.