A probabilistic counting lemma for complete graphs (Q5433274)
From MaRDI portal
scientific article; zbMATH DE number 5224136
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A probabilistic counting lemma for complete graphs |
scientific article; zbMATH DE number 5224136 |
Statements
A probabilistic counting lemma for complete graphs (English)
0 references
8 January 2008
0 references
Szemerédi regularity
0 references
sparse graph
0 references
counting lemma
0 references
Turán's problem in random graphs
0 references
