arXiv:math/9707226 Abstract

arXiv:math/9707226 [math.CO]Abstract References Reviews Resources

Erdős and Renyi conjecture

Published 1997-07-15Version 1

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.

Categories: math.CO, math.LO

Keywords: renyi conjecture, real number, exemplifies

Related articles: Most relevant | Search more

arXiv:2102.07722 [math.CO] (Published 2021-02-15)

Expansions in Cantor real bases

Émilie Charlier, Célia Cisternino

arXiv:2501.05029 [math.CO] (Published 2025-01-09)

An Aα-spectral radius for the existence of {P3, P4, P5}-factors in graphs

Yuli Zhang, Sizhong Zhou

arXiv:math/0609536 [math.CO] (Published 2006-09-19)

Eleven Euclidean Distances are Enough

Sujith Vijay