The DOI matches its Crossref record.
A new proof of the graph removal lemma
Open accessAbstract
Let H be a fixed graph with h vertices.The graph removal lemma states that every graph on n vertices with o(n h ) copies of H can be made H-free by removing o(n 2 ) edges.We give a new proof which avoids Szemerédi's regularity lemma and gives a better bound.This approach also works to give improved bounds for the directed and multicolored analogues of the graph removal lemma.This answers questions of Alon and Gowers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Introduction to Property Testing
Goldreich, O. (2017) · Cambridge University Press eBooks · doi:10.1017/9781108135252 · Cited by 270
New applications of the polynomial method: The cap set conjecture and beyond
Grochow, J. (2018) · Bulletin of the American Mathematical Society · doi:10.1090/bull/1648 · Cited by 16
Metadata
- Authors
- Fox, J.
- Venue
- Annals of Mathematics
- Publisher
- Annals of Mathematics
- Published
- 2011-07-01
- Volume
- 174
- Issue
- 1
- Pages
- 561-579
- ISSN
- 0003-486X (ISSN-L)
- OpenAlex
- W2164542539
- Cited by
- 159
- References
- 0
- FWCI
- 14.21
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.