Pages that link to "Item:Q855826"
From MaRDI portal
The following pages link to A variant of the hypergraph removal lemma (Q855826):
Displaying 50 items.
- Szemerédi's regularity lemma via martingales (Q311501) (← links)
- Online containers for hypergraphs, with applications to linear equations (Q326815) (← links)
- On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs (Q331490) (← links)
- Combinatorial theorems in sparse random sets (Q350550) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- A measure-theoretic approach to the theory of dense hypergraphs (Q456779) (← links)
- On the KŁR conjecture in random graphs (Q476516) (← links)
- Counting substructures. II: Hypergraphs (Q485550) (← links)
- A new proof of the graph removal lemma (Q640795) (← links)
- The primes contain arbitrarily long polynomial progressions (Q732174) (← links)
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma (Q926374) (← links)
- An exact Turán result for the generalized triangle (Q949792) (← links)
- Weak hypergraph regularity and linear hypergraphs (Q965243) (← links)
- Linear equations in primes (Q974077) (← links)
- Generalizations of the removal lemma (Q987562) (← links)
- Hereditary properties of hypergraphs (Q1003850) (← links)
- On the Ramsey number of sparse 3-graphs (Q1015430) (← links)
- A combinatorial proof of the removal lemma for groups (Q1024351) (← links)
- Additive combinatorics and graph theory (Q1620873) (← links)
- A multidimensional Szemerédi theorem in the primes via combinatorics (Q1710999) (← links)
- A removal lemma for systems of linear equations over finite fields (Q1758978) (← links)
- A new bound for the Brown-Erdős-Sós problem (Q2101162) (← links)
- Efficient removal lemmas for matrices (Q2183099) (← links)
- Keisler's order is not simple (and simple theories may not be either) (Q2237409) (← links)
- On \(k\)-uniform random hypergraphs without generalized fans (Q2243140) (← links)
- A tight bound for hypergraph regularity (Q2334614) (← links)
- A relative Szemerédi theorem (Q2355780) (← links)
- Extremal results in sparse pseudorandom graphs (Q2445889) (← links)
- Multiple recurrence in quasirandom groups (Q2453444) (← links)
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs (Q2477627) (← links)
- The Gaussian primes contain arbitrarily shaped constellations (Q2479612) (← links)
- Sum-avoiding sets in groups (Q2826221) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- MIXING FOR PROGRESSIONS IN NONABELIAN GROUPS (Q2849814) (← links)
- <i>σ</i>-algebras for quasirandom hypergraphs (Q2951886) (← links)
- The effect of induced subgraphs on quasi-randomness (Q3055880) (← links)
- The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle (Q3068812) (← links)
- A hypergraph blow-up lemma (Q3094607) (← links)
- The quasi-randomness of hypergraph cut properties (Q3119045) (← links)
- Generalizations of Fourier analysis, and how to apply them (Q3178746) (← links)
- Hypergraph limits: A regularity approach (Q3192379) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A hypergraph regularity method for generalized Turán problems (Q3608316) (← links)
- A sparse regular approximation lemma (Q4633762) (← links)
- An analytic approach to sparse hypergraphs: hypergraph removal (Q4645028) (← links)
- Hypergraph Independent Sets (Q4903260) (← links)
- Green’s Conjecture and Testing Linear Invariant Properties (Q4933388) (← links)
- Estimating parameters associated with monotone properties (Q4993108) (← links)
- Efficient Removal Lemmas for Matrices (Q5002628) (← links)
- Weak hypergraph regularity and applications to geometric Ramsey theory (Q5068114) (← links)
