A probabilistic counting lemma for complete graphs (Q5433274)
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: A probabilistic counting lemma for complete graphs |
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
0.90623415
0 references
0.90623415
0 references
0.8995172
0 references
0.89460874
0 references
0.8942735
0 references
0.8926032
0 references
0.89131606
0 references
