Many cliques in \(H\)-free subgraphs of random graphs (Q1630692)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Many cliques in H-free subgraphs of random graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Many cliques in \(H\)-free subgraphs of random graphs |
scientific article |
Statements
Many cliques in \(H\)-free subgraphs of random graphs (English)
0 references
10 December 2018
0 references
Turán type problems
0 references
random graphs
0 references
chromatic number
0 references
0.8182052969932556
0 references
0.799338698387146
0 references
0.7936584949493408
0 references
0.7903735041618347
0 references
0.7876086235046387
0 references
