Efficient removal lemmas for matrices
From MaRDI portal
Publication:2183099
DOI10.1007/s11083-019-09494-3zbMath1481.05020OpenAlexW2945670815WikidataQ124792018 ScholiaQ124792018MaRDI QIDQ2183099
Publication date: 26 May 2020
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7574/
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A new proof of the graph removal lemma
- A variant of the hypergraph removal lemma
- Bounds for graph regularity and removal lemmas
- Testing of matrix-poset properties
- Regular Languages are Testable with a Constant Number of Queries
- Graph removal lemmas
- Regularity partitions and the topology of graphons
- Property testing and its connection to learning and approximation
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
- A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects
- The Algorithmic Aspects of the Regularity Lemma
- Testing subgraphs in large graphs
- Regularity Lemma for k-uniform hypergraphs
- Robust Characterizations of Polynomials with Applications to Program Testing
- Invariance in Property Testing
- Removal lemmas with polynomial bounds
- Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
- Earthmover Resilience and Testing in Ordered Structures
- Easily Testable Graph Properties
- The counting lemma for regular k‐uniform hypergraphs
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Efficient testing of large graphs
- A new proof of Szemerédi's theorem
