The following pages link to Easily Testable Graph Properties (Q5364250):
Displaying 17 items.
- Estimating the distance to a hereditary graph property (Q1689980) (← links)
- The Bradley-Terry condition is \(L_1\)-testable (Q1699573) (← links)
- Testing graphs against an unknown distribution (Q2130521) (← links)
- A characterization of easily testable induced digraphs and \(k\)-colored graphs (Q2136197) (← links)
- Efficient removal lemmas for matrices (Q2183099) (← links)
- A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing (Q2956040) (← links)
- Fast Property Testing and Metrics for Permutations (Q3177362) (← links)
- On the Query Complexity of Estimating the Distance to Hereditary Graph Properties (Q4992842) (← links)
- Efficient Testing without Efficient Regularity (Q4993324) (← links)
- Efficient Removal Lemmas for Matrices (Q5002628) (← links)
- (Q5009551) (← links)
- Polynomial removal lemmas for ordered graphs (Q5051460) (← links)
- On 3‐graphs with no four vertices spanning exactly two edges (Q6051388) (← links)
- Local-vs-global combinatorics (Q6198642) (← links)
- Testing versus estimation of graph properties, revisited (Q6623575) (← links)
- Abundance: asymmetric graph removal lemmas and integer solutions to linear equations (Q6641588) (← links)
- Induced subgraph density. II: Sparse and dense sets in cographs (Q6655697) (← links)
