A new proof of the graph removal lemma¶
Fox, J. (2011). A new proof of the graph removal lemma. Annals of Mathematics.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Ruzsa–Szemerédi Problem
- Triangle removal supplies the qualitative subquadratic upper bound and later quantitative improvements, but it is a more general theorem about graphs with few triangles being close to triangle-free
This sourceFox's proof of the graph removal lemma in its general form -- every n-vertex graph with o(n^h) copies of a fixed H can be made H-free by deleting o(n^2) edges -- with a bound better than the regularity-lemma proof gives; the original subquadratic bound for this problem is Ruzsa-Szemeredi's.
Supported in partVerified against the source
- Triangle removal supplies the qualitative subquadratic upper bound and later quantitative improvements, but it is a more general theorem about graphs with few triangles being close to triangle-free
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:f605f4ae053a · see in the full table