A new proof of the graph removal lemma
From MaRDI portal
Publication:640795
DOI10.4007/annals.2011.174.1.17zbMath1231.05133arXiv1006.1300OpenAlexW2164542539WikidataQ105584489 ScholiaQ105584489MaRDI QIDQ640795
Publication date: 20 October 2011
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.1300
Related Items
On an almost all version of the Balog-Szemeredi-Gowers theorem ⋮ The length of an s-increasing sequence of r-tuples ⋮ Removal lemmas and approximate homomorphisms ⋮ Extremal problems for pairs of triangles ⋮ A characterization of easily testable induced digraphs and \(k\)-colored graphs ⋮ Polynomial removal lemmas for ordered graphs ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ Generalizations of Fourier analysis, and how to apply them ⋮ Short proofs of some extremal results. II. ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ A unique characterization of spectral extrema for friendship graphs ⋮ Induced Ramsey number for a star versus a fixed graph ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ A polynomial bound for the arithmetic \(k\)-cycle removal lemma in vector spaces ⋮ Efficient Removal Lemmas for Matrices ⋮ A tight bound for Green's arithmetic triangle removal lemma in vector spaces ⋮ Sunflowers and testing triangle-freeness of functions ⋮ Efficient removal lemmas for matrices ⋮ Bounds for graph regularity and removal lemmas ⋮ On 3‐graphs with no four vertices spanning exactly two edges ⋮ Estimating the distance to a hereditary graph property ⋮ Minimum degree and the graph removal lemma ⋮ Reachability Preservers: New Extremal Bounds and Approximation Algorithms ⋮ Graphs without a Rainbow Path of Length 3 ⋮ The minimum degree removal lemma thresholds ⋮ KKL's influence on me ⋮ Local-vs-global combinatorics ⋮ Prominent examples of flip processes ⋮ Additive structure in convex translates ⋮ Easily Testable Graph Properties ⋮ On Directed Versions of the Hajnal–Szemerédi Theorem ⋮ Triangles in graphs without bipartite suspensions ⋮ Maximal antichains of minimum size ⋮ Some exact results of the generalized Turán numbers for paths ⋮ The maximum spectral radius of graphs without friendship subgraphs ⋮ Average Gromov hyperbolicity and the Parisi ansatz ⋮ Extremal results in sparse pseudorandom graphs ⋮ Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs ⋮ On a problem of Erdős and Rothschild on edges in triangles ⋮ Efficient Testing without Efficient Regularity ⋮ \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups ⋮ On the KŁR conjecture in random graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A sparse regular approximation lemma ⋮ A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity ⋮ More Turán-type theorems for triangles in convex point sets ⋮ The spectral radius of graphs with no odd wheels ⋮ Kneser graphs are like Swiss cheese ⋮ An analytic approach to sparse hypergraphs: hypergraph removal ⋮ The critical window for the classical Ramsey-Turán problem ⋮ Unnamed Item ⋮ Chang's lemma via Pinsker's inequality ⋮ Roth-type theorems in finite groups ⋮ New short proofs to some stability theorems ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Inflatable Graph Properties and Natural Property Tests ⋮ The Induced Removal Lemma in Sparse Graphs ⋮ UPPER BOUND THEOREM FOR ODD‐DIMENSIONAL FLAG TRIANGULATIONS OF MANIFOLDS ⋮ Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits ⋮ On the Query Complexity of Estimating the Distance to Hereditary Graph Properties ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Estimating parameters associated with monotone properties ⋮ SCHUR’S COLOURING THEOREM FOR NONCOMMUTING PAIRS ⋮ Independent sets in hypergraphs ⋮ A tight bound for hypergraph regularity ⋮ New Results on Linear Size Distance Preservers ⋮ Lower bounds for testing triangle-freeness in Boolean functions ⋮ The regularity method for graphs with few 4‐cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Supersaturated graphs and hypergraphs
- A variant of the hypergraph removal lemma
- A combinatorial proof of the removal lemma for groups
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Problems and results in combinatorial analysis and graph theory
- Lower bounds of tower type for Szemerédi's uniformity lemma
- Note on integral distances
- A removal lemma for systems of linear equations over finite fields
- Hypergraph regularity and the multidimensional Szemerédi theorem
- A Szemerédi-type regularity lemma in abelian groups, with applications
- Property testing and its connection to learning and approximation
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- ON A GENERALIZATION OF SZEMERÉDI'S THEOREM
- A proof of Green's conjecture regarding the removal properties of sets of linear equations
- The Maturation of the Probabilistic Method
- On sets of integers containing k elements in arithmetic progression
- Maximal antiramsey graphs and the strong chromatic number
- Testing subgraphs in large graphs
- Regularity Lemma for k-uniform hypergraphs
- Robust Characterizations of Polynomials with Applications to Program Testing
- The counting lemma for regular k‐uniform hypergraphs
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Testing subgraphs in directed graphs
- A new proof of Szemerédi's theorem
