Extremal results in sparse pseudorandom graphs (Q2445889)
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: Extremal results in sparse pseudorandom graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremal results in sparse pseudorandom graphs |
scientific article |
Statements
Extremal results in sparse pseudorandom graphs (English)
0 references
15 April 2014
0 references
Szemerédi's regularity lemma
0 references
sparse regularity lemma
0 references
counting lemma
0 references
graph removal lemma
0 references
extremal combinatorics
0 references
sparse graphs
0 references
0 references
0 references
0 references
0 references
0.8758388757705688
0 references
0.8457822203636169
0 references
0.8382858633995056
0 references
0.8381824493408203
0 references
0.8329488635063171
0 references
