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.
- 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¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:f605f4ae053a · see in the full table