Testing subgraphs in large graphs
From MaRDI portal
Recommendations
Cited in
(69)- Testing Odd-Cycle-Freeness in Boolean Functions
- Testing whether a digraph contains H-free k-induced subgraphs
- Property testing of massively parametrized problems -- a survey
- scientific article; zbMATH DE number 7238981 (Why is no real title available?)
- Edge correlations in Random regular hypergraphs and applications to subgraph testing
- Triforce and corners
- On 3‐graphs with no four vertices spanning exactly two edges
- Efficient testing without efficient regularity
- Unavoidable tournaments
- Extremal edge polytopes
- Test dense subgraphs in sparse uniform hypergraph
- Testing subgraphs in directed graphs
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- An efficient asymmetric removal lemma and its limitations
- Finite field models in arithmetic combinatorics -- ten years on
- Contemplations on Testing Graph Properties
- Estimating parameters associated with monotone properties
- The minimum degree removal lemma thresholds (extended abstract)
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
- On the testability of graph partition properties
- Hierarchy theorems for property testing
- A characterization of easily testable induced digraphs and \(k\)-colored graphs
- Coloring locally sparse graphs
- Testing linear inequalities of subgraph statistics
- Near-optimal distance emulator for planar graphs
- Testing odd-cycle-freeness in Boolean functions
- Minimum degree and the graph removal lemma
- The removal lemma for tournaments
- On the benefits of adaptivity in property testing of dense graphs
- Fast property testing and metrics for permutations
- Introduction to testing graph properties
- New results on linear size distance preservers
- Current algorithms for detecting subgraphs of bounded treewidth are probably optimal
- Testing triangle freeness in the general model in graphs with arboricity \(O(\sqrt{n})\)
- On the communication complexity of high-dimensional permutations
- Introduction to testing graph properties
- New fault tolerant subset preservers
- Polynomial removal lemma for ordered matchings
- A new proof of the graph removal lemma
- Inflatable graph properties and natural property tests
- The minimum degree removal lemma thresholds
- Local-vs-global combinatorics
- Lower bounds on sparse spanners, emulators, and diameter-reducing shortcuts
- (Quantum) complexity of testing signed graph clusterability
- Hierarchy theorems for testing properties in size-oblivious query complexity
- Testing subgraphs in directed graphs
- Prominent examples of flip processes
- Abundance: asymmetric graph removal lemmas and integer solutions to linear equations
- The edit distance function of some graphs
- Testing C_k-freeness in bounded-arboricity graphs
- Efficient removal lemmas for matrices
- Some remarks on barycentric-sum problems over cyclic groups
- Polynomial removal lemmas for ordered graphs
- scientific article; zbMATH DE number 6469238 (Why is no real title available?)
- Nearly complete graphs decomposable into large induced matchings and their applications
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Patterns without a popular difference
- Efficient removal lemmas for matrices
- On regularity lemma and barriers in streaming and dynamic matching
- A sublinear bipartiteness tester for bounded degree graphs
- Lower bounds for testing triangle-freeness in Boolean functions
- Easily testable graph properties
- Bounds for graph regularity and removal lemmas
- A generalized Turán problem and its applications
- Hypergraph removal with polynomial bounds
- On the average-case complexity of property testing
- Testing k-colorability
- The number of 4-cycles and the cyclomatic number of a finite simple graph
- Colorings with only rainbow arithmetic progressions
This page was built for publication: Testing subgraphs in large graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798173)
