Pages that link to "Item:Q2848211"
From MaRDI portal
The following pages link to Every property of hyperfinite graphs is testable (Q2848211):
Displaying 27 items.
- Finite graphs and amenability (Q1760172) (← links)
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs (Q2304167) (← links)
- Infinite dimensional representations of finite dimensional algebras and amenability (Q2405948) (← links)
- A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850) (← links)
- Property Testing for Bounded Degree Databases (Q3304100) (← links)
- (Q4606322) (← links)
- Every property of outerplanar graphs is testable (Q4636453) (← links)
- (Q5090383) (← links)
- (Q5090414) (← links)
- Convergence theorems for graph sequences (Q5175610) (← links)
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity (Q5189542) (← links)
- Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty (Q5236227) (← links)
- Planar graphs: Random walks and bipartiteness testing (Q5236926) (← links)
- Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing (Q5237911) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← links)
- Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs (Q5890147) (← links)
- Approximating power node-deletion problems (Q6057334) (← links)
- Testability in group theory (Q6076186) (← links)
- (Q6084359) (← links)
- Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)
- Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs (Q6140983) (← links)
- On testability of first-order properties in bounded-degree graphs and connections to proximity-oblivious testing (Q6573776) (← links)
- Approximating power node-deletion problems (Q6593676) (← links)
