Posets are easily testable
From MaRDI portal
Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Approximation algorithms (68W25) Combinatorics of partially ordered sets (06A07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites work
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 6469238 (Why is no real title available?)
- A Szemerédi-type regularity lemma in abelian groups, with applications
- A generalized Turán problem and its applications
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- A removal lemma for systems of linear equations over finite fields
- Easily testable graph properties
- Every locally characterized affine-invariant property is testable
- Every monotone graph property is testable
- Fast property testing and metrics for permutations
- Generalizations of the removal lemma
- Hereditary properties of permutations are strongly testable
- Hypergraph removal with polynomial bounds
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On a problem of K. Zarankiewicz
- Polynomial removal lemmas for ordered graphs
- Poset limits can be totally ordered
- Property testing and its connection to learning and approximation
- Robust Characterizations of Polynomials with Applications to Program Testing
- Testability and repair of hereditary hypergraph properties
- Testing hereditary properties of ordered graphs and matrices
- Testing properties of graphs and functions
- Testing subgraphs in directed graphs
This page was built for publication: Posets are easily testable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6945772)
