Metraipolis › archive › dc_3c5fb348a8cf
Graph removal lemma — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Graph_removal_lemma
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T23:23:05.275Z
- SHA-256 of the archived text
1128d0cead2724b6b33306134564009b0325217aa148c314840b7146bedb1bb6- Stable URL of this page
https://metraipolis.com/documento/dc_3c5fb348a8cf
How to cite
Graph removal lemma — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Graph_removal_lemma (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_3c5fb348a8cf (Metraipolis archive dc_3c5fb348a8cf, sha256 1128d0cead2724b6b33306134564009b0325217aa148c314840b7146bedb1bb6)
BibTeX
@misc{dc3c5fb348a8cf,
title = {Graph removal lemma — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Graph_removal_lemma},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_3c5fb348a8cf; sha256 1128d0cead2724b6b33306134564009b0325217aa148c314840b7146bedb1bb6},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Graph_removal_lemma. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In graph theory, the graph removal lemma states that when a graph contains few copies of a given subgraph, then all of the copies can be eliminated by removing a small number of edges. The special case in which the subgraph is a triangle is known as the triangle removal lemma. The graph removal lemma can be used to prove Roth's theorem on 3-term arithmetic progressions, and a generalization of it, the hypergraph removal lemma, can be used to prove Szemerédi's theorem. It also has applications to property testing. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»). Fonte: Wikipedia in inglese, voce «Graph removal lemma» — https://en.wikipedia.org/wiki/Graph_removal_lemma Wikidata Q62931187 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q62931187 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Graph_removal_lemma?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1360690218, consultata il 2026-10-07T23:02:11.442Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: b79f74ef7cd26886d33de1ca522301bfaa85f92a92f231a8e2a8e95e56172970