Pages that link to "Item:Q987562"
From MaRDI portal
The following pages link to Generalizations of the removal lemma (Q987562):
Displaying 18 items.
- On the algebraic and topological structure of the set of Turán densities (Q256996) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- A measure-theoretic approach to the theory of dense hypergraphs (Q456779) (← links)
- On possible Turán densities (Q466081) (← links)
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (Q648971) (← links)
- The codegree threshold of \(K_4^-\) (Q1689950) (← links)
- Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- The Codegree Threshold for 3-Graphs with Independent Neighborhoods (Q2944457) (← links)
- A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing (Q2956040) (← links)
- Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Anticoncentration for subgraph statistics (Q4967964) (← links)
- A unified framework for testing linear‐invariant properties (Q4982614) (← links)
- On 3‐graphs with no four vertices spanning exactly two edges (Q6051388) (← links)
- Lagrangian-perfect hypergraphs (Q6084663) (← links)
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm (Q6133947) (← links)
- Local-vs-global combinatorics (Q6198642) (← links)
