The following pages link to Testing subgraphs in large graphs (Q4798173):
Displaying 50 items.
- Nearly complete graphs decomposable into large induced matchings and their applications (Q363228) (← links)
- Extremal edge polytopes (Q405274) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
- A new proof of the graph removal lemma (Q640795) (← links)
- Unavoidable tournaments (Q895998) (← links)
- Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (Q955032) (← links)
- Bounds for graph regularity and removal lemmas (Q1930904) (← links)
- A sublinear bipartiteness tester for bounded degree graphs (Q1964592) (← links)
- A characterization of easily testable induced digraphs and \(k\)-colored graphs (Q2136197) (← links)
- The edit distance function of some graphs (Q2175239) (← links)
- Efficient removal lemmas for matrices (Q2183099) (← links)
- Colorings with only rainbow arithmetic progressions (Q2220973) (← links)
- Hierarchy theorems for testing properties in size-oblivious query complexity (Q2281254) (← links)
- Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
- Sunflowers and testing triangle-freeness of functions (Q2410684) (← links)
- The removal lemma for tournaments (Q2421551) (← links)
- Some remarks on barycentric-sum problems over cyclic groups (Q2509726) (← links)
- Finite field models in arithmetic combinatorics -- ten years on (Q2512891) (← links)
- Testing \(k\)-colorability (Q2784512) (← links)
- A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing (Q2956040) (← links)
- Inflatable Graph Properties and Natural Property Tests (Q3088125) (← links)
- On the Average-Case Complexity of Property Testing (Q3088183) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Contemplations on Testing Graph Properties (Q3088201) (← links)
- Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444) (← links)
- Fast Property Testing and Metrics for Permutations (Q3177362) (← links)
- Patterns without a popular difference (Q3382243) (← links)
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs (Q3507528) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Property Testing of Massively Parametrized Problems – A Survey (Q4933366) (← links)
- Triforce and corners (Q4958657) (← links)
- Estimating parameters associated with monotone properties (Q4993108) (← links)
- Efficient Testing without Efficient Regularity (Q4993324) (← links)
- Efficient Removal Lemmas for Matrices (Q5002628) (← links)
- (Q5009551) (← links)
- (Q5009573) (← links)
- Polynomial removal lemmas for ordered graphs (Q5051460) (← links)
- The number of $4$-cycles and the cyclomatic number of a finite simple graph (Q5060435) (← links)
- Test dense subgraphs in sparse uniform hypergraph (Q5079097) (← links)
- (Q5090432) (← links)
- (Q5116490) (← links)
- Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts (Q5157382) (← links)
- Easily Testable Graph Properties (Q5364250) (← links)
- (Q5501357) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
- (Q5743465) (← links)
- New Results on Linear Size Distance Preservers (Q5858650) (← links)
- Testing subgraphs in directed graphs (Q5917574) (← links)
- Testing linear inequalities of subgraph statistics (Q6049999) (← links)
