Many cliques in \(H\)-free subgraphs of random graphs (Q1630692): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1612.09143 / rank | |||
Normal rank | |||
Latest revision as of 20:11, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
