A variant of the hypergraph removal lemma

DOI10.1016/j.jcta.2005.11.006zbMath1105.05052arXivmath/0503572OpenAlexW2058870462WikidataQ56341570 ScholiaQ56341570MaRDI QIDQ855826

Terence C. Tao

Publication date: 7 December 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0503572

zbMATH Keywords

Szemerédi regularity lemma sigma algebras triangle removal lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Other combinatorial number theory (11B75) Structural characterization of families of graphs (05C75)

Related Items

Removal lemmas and approximate homomorphisms, Additive combinatorics and graph theory, Szemerédi's regularity lemma via martingales, Generalizations of Fourier analysis, and how to apply them, Online containers for hypergraphs, with applications to linear equations, On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs, Weak hypergraph regularity and applications to geometric Ramsey theory, Hypergraph limits: A regularity approach, Combinatorial theorems in sparse random sets, Efficient Removal Lemmas for Matrices, Efficient removal lemmas for matrices, σ-algebras for quasirandom hypergraphs, Hypergraph regularity and random sampling, Subsets of without L-shaped configurations, Local-vs-global combinatorics, On the Chromatic Thresholds of Hypergraphs, Testable and untestable classes of first-order formulae, A new proof of the graph removal lemma, Corners Over Quasirandom Groups, A multidimensional Szemerédi theorem in the primes via combinatorics, A measure-theoretic approach to the theory of dense hypergraphs, Extremal results in sparse pseudorandom graphs, A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma, Norm convergence of multiple ergodic averages for commuting transformations, Multiple recurrence in quasirandom groups, On the KŁR conjecture in random graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A sparse regular approximation lemma, Counting substructures. II: Hypergraphs, Keisler's order is not simple (and simple theories may not be either), Hypergraph Independent Sets, An analytic approach to sparse hypergraphs: hypergraph removal, An exact Turán result for the generalized triangle, On \(k\)-uniform random hypergraphs without generalized fans, An arithmetic transference proof of a relative Szemerédi theorem, Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs, Stability results for random discrete structures, The Gaussian primes contain arbitrarily shaped constellations, A removal lemma for systems of linear equations over finite fields, Weak hypergraph regularity and linear hypergraphs, Linear equations in primes, Green’s Conjecture and Testing Linear Invariant Properties, The symmetry preserving removal lemma, Generalizations of the removal lemma, The effect of induced subgraphs on quasi-randomness, A hypergraph regularity method for generalized Turán problems, Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems, The primes contain arbitrarily long polynomial progressions, The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle, Hereditary properties of hypergraphs, On the Ramsey number of sparse 3-graphs, A combinatorial proof of the removal lemma for groups, A hypergraph blow-up lemma, Sum-avoiding sets in groups, 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, The quasi-randomness of hypergraph cut properties, MIXING FOR PROGRESSIONS IN NONABELIAN GROUPS, From harmonic analysis to arithmetic combinatorics, A tight bound for hypergraph regularity, A new bound for the Brown-Erdős-Sós problem, The poset of hypergraph quasirandomness, A relative Szemerédi theorem

Cites Work