Linear equations, arithmetic progressions and hypergraph property testing
From MaRDI portal
Recommendations
Cited in
(13)- Linear equations, arithmetic progressions and hypergraph property testing
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- A proof of Green's conjecture regarding the removal properties of sets of linear equations
- scientific article; zbMATH DE number 2086691 (Why is no real title available?)
- Polynomial removal lemmas for ordered graphs
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Every Monotone 3‐Graph Property is Testable
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- On 3‐graphs with no four vertices spanning exactly two edges
- Multicolor Turán numbers. II: A generalization of the Ruzsa-Szemerédi theorem and new results on cliques and odd cycles
- A characterization of testable hypergraph properties
- Hypergraph removal with polynomial bounds
- Complete 3-term arithmetic progression free sets of small size in vector spaces and other abelian groups
This page was built for publication: Linear equations, arithmetic progressions and hypergraph property testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002762)