A removal lemma for ordered hypergraphs
From MaRDI portal
Cites work
- σ-algebras for quasirandom hypergraphs
- A functional interpretation for nonstandard arithmetic
- A measure-theoretic approach to the theory of dense hypergraphs
- A new proof of the graph removal lemma
- A tight bound for hypergraph regularity
- A variant of the hypergraph removal lemma
- An analytic approach to sparse hypergraphs: hypergraph removal
- An approximate logic for measures
- Efficient removal lemmas for matrices
- Efficient testing of large graphs
- Graph limits and exchangeable random graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Large networks and graph limits
- Limits of Latin squares
- Limits of dense graph sequences
- Limits of permutation sequences
- Query-to-communication lifting for BPP
- Regularity Lemma for k-uniform hypergraphs
- Regularity lemmas for hypergraphs and quasi-randomness
- Representations for partially exchangeable arrays of random variables
- Semantic limits of dense combinatorial objects
- Szemerédi's regularity lemma revisited
- Testing hereditary properties of ordered graphs and matrices
- The counting lemma for regular k‐uniform hypergraphs
- Weak hypergraph regularity and linear hypergraphs
- Weak quasi-randomness for uniform hypergraphs
- What do ultraproducts remember about the original structures?
This page was built for publication: A removal lemma for ordered hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034635)
