The symmetry preserving removal lemma
From MaRDI portal
Publication:5189164
DOI10.1090/S0002-9939-09-09860-8zbMath1223.05205arXiv0809.2626WikidataQ124843191 ScholiaQ124843191MaRDI QIDQ5189164
Publication date: 8 March 2010
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0809.2626
Related Items
A unified framework for testing linear‐invariant properties, Counting configuration-free sets in groups, Counting configuration-free sets in groups, Online containers for hypergraphs, with applications to linear equations, On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs, Limits of kernel operators and the spectral regularity lemma, A combinatorial proof of the removal lemma for groups, A removal lemma for systems of linear equations over finite fields
Cites Work
- A variant of the hypergraph removal lemma
- A combinatorial proof of the removal lemma for groups
- A Szemerédi-type regularity lemma in abelian groups, with applications
- Vertex-disjoint cycles of length at most four each of which contains a specified vertex
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- On sets of integers containing k elements in arithmetic progression
- Regularity Lemma for k-uniform hypergraphs
- A Note on a Question of Erdős and Graham
- Regular Partitions of Hypergraphs: Regularity Lemmas
- The counting lemma for regular k‐uniform hypergraphs
