Efficient testing without efficient regularity
From MaRDI portal
Recommendations
- Efficient removal without efficient regularity
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
- Efficient testing of large graphs
- A combinatorial characterization of the testable graph properties, it's all about regularity
Cites work
- scientific article; zbMATH DE number 3869331 (Why is no real title available?)
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 6469238 (Why is no real title available?)
- A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
- A new proof of the graph removal lemma
- A short proof of Gowers' lower bound for the regularity lemma
- Bounds for graph regularity and removal lemmas
- Easily testable graph properties
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
- Efficient testing of large graphs
- Graph removal lemmas
- Introduction to Property Testing
- Large cliques in \(C_4\)-free graphs
- Large networks and graph limits
- Lower bounds of tower type for Szemerédi's uniformity lemma
- On Proximity-Oblivious Testing
- On extremal problems of graphs and generalized graphs
- On graphs with small subgraphs of large chromatic number
- Property testing and its connection to learning and approximation
- Robust Characterizations of Polynomials with Applications to Program Testing
- Testing graph blow-up
- Testing subgraphs in large graphs
Cited in
(5)
This page was built for publication: Efficient testing without efficient regularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993324)
