Generalizations of the removal lemma
From MaRDI portal
Publication:987562
DOI10.1007/s00493-009-2320-xzbMath1212.05133OpenAlexW2019475553WikidataQ124805579 ScholiaQ124805579MaRDI QIDQ987562
Publication date: 13 August 2010
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-009-2320-x
Related Items
Removal lemmas and approximate homomorphisms ⋮ Testing Odd-Cycle-Freeness in Boolean Functions ⋮ An Irrational Lagrangian Density of a Single Hypergraph ⋮ The Codegree Threshold for 3-Graphs with Independent Neighborhoods ⋮ On 3‐graphs with no four vertices spanning exactly two edges ⋮ Lagrangian-perfect hypergraphs ⋮ The codegree threshold of \(K_4^-\) ⋮ A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ Local-vs-global combinatorics ⋮ Testable and untestable classes of first-order formulae ⋮ A measure-theoretic approach to the theory of dense hypergraphs ⋮ The minimum size of 3-graphs without a 4-set spanning no or exactly three edges ⋮ On possible Turán densities ⋮ Semantic limits of dense combinatorial objects ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs ⋮ Anticoncentration for subgraph statistics ⋮ A unified framework for testing linear‐invariant properties ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Unnamed Item ⋮ Lower bounds for testing triangle-freeness in Boolean functions ⋮ On the algebraic and topological structure of the set of Turán densities
Cites Work
- Unnamed Item
- Unnamed Item
- A variant of the hypergraph removal lemma
- Limits of dense graph sequences
- On graphs with small subgraphs of large chromatic number
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- An ergodic Szemerédi theorem for IP-systems and combinatorial theory
- An ergodic Szemerédi theorem for commuting transformations
- Density theorems and extremal hypergraph problems
- Hypergraph regularity and the multidimensional Szemerédi theorem
- On the existence of triangulated spheres in 3-graphs, and related problems
- Graph limits and parameter testing
- Property testing and its connection to learning and approximation
- Every monotone graph property is testable
- On sets of integers containing k elements in arithmetic progression
- Extremal problems on set systems
- Regularity Lemma for k-uniform hypergraphs
- A Note on a Question of Erdős and Graham
- The hypergraph regularity method and its applications
- Regularity, uniformity, and quasirandomness
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regular Partitions of Hypergraphs: Counting Lemmas
- Every Monotone 3‐Graph Property is Testable
- The counting lemma for regular k‐uniform hypergraphs
- Applications of the regularity lemma for uniform hypergraphs
- Efficient testing of large graphs
