Erdős and Rényi conjecture (Q1268624)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1212927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Erdős and Rényi conjecture |
scientific article; zbMATH DE number 1212927 |
Statements
Erdős and Rényi conjecture (English)
0 references
1 February 1999
0 references
A conjecture of Erdős and Rényi is confirmed. It is shown that for any positive real number \(c_1 > 0\) there is a \(c_2 > 0\) such that if a graph \(G\) of order \(n\) does not contain a complete graph or an independent set with \(c_1 \log n\) vertices, then \(G\) contains at least \(2^{c_2n}\) nonisomorphic induced subgraphs.
0 references
induced subgraphs
0 references
Ramsey theory
0 references
0.8277028799057007
0 references
0.8131217956542969
0 references
0.8129711151123047
0 references
0.812450110912323
0 references
0.8101729154586792
0 references
