Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
combinatorics
graph theory |
| gptkbp:generalizes |
gptkb:Erdős–Rényi_model
|
| gptkbp:hasConcept |
dense graphs
regular partition ε-regular pairs |
| https://www.w3.org/2000/01/rdf-schema#label |
Szemerédi regularity lemma
|
| gptkbp:influenced |
graph limit theory
graph property testing hypergraph regularity lemma |
| gptkbp:namedAfter |
gptkb:Endre_Szemerédi
|
| gptkbp:provenBy |
gptkb:Endre_Szemerédi
|
| gptkbp:relatedTo |
gptkb:Ramsey_theory
gptkb:Erdős–Stone_theorem gptkb:Szemerédi's_theorem graph partition |
| gptkbp:state |
Every large enough graph can be partitioned into a bounded number of random-like bipartite graphs plus a small error set.
|
| gptkbp:usedIn |
gptkb:extremal_graph_theory
additive combinatorics property testing graph limits |
| gptkbp:yearProved |
1975
|
| gptkbp:bfsParent |
gptkb:Endre_Szemerédi
|
| gptkbp:bfsLayer |
4
|