An analytic approach to sparse hypergraphs: hypergraph removal
From MaRDI portal
Publication:4645028
DOI10.19086/da.3104zbMath1404.05143arXiv1204.1884OpenAlexW2963327389MaRDI QIDQ4645028
Publication date: 9 January 2019
Published in: Discrete Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.1884
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial theorems in sparse random sets
- A point of view on Gowers uniformity norms
- A measure-theoretic approach to the theory of dense hypergraphs
- On the KŁR conjecture in random graphs
- Hypergraph containers
- A new proof of the graph removal lemma
- The primes contain arbitrarily long polynomial progressions
- A variant of the hypergraph removal lemma
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Turán's theorem for pseudo-random graphs
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- On limits of finite graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Representations for partially exchangeable arrays of random variables
- Hypergraphs, quasi-randomness, and conditions for regularity
- Sparse quasi-random graphs
- An approximate logic for measures
- A relative Szemerédi theorem
- Nonconventional ergodic averages and nilmanifolds
- The primes contain arbitrarily long arithmetic progressions
- Extremal results in sparse pseudorandom graphs
- The Gaussian primes contain arbitrarily shaped constellations
- Hypergraph regularity and the multidimensional Szemerédi theorem
- σ-algebras for quasirandom hypergraphs
- Testability and repair of hereditary hypergraph properties
- Stable group theory and approximate subgroups
- Weak quasi-randomness for uniform hypergraphs
- An infinitesimal approach to stochastic analysis
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Convergence of diagonal ergodic averages
- Quasi-random hypergraphs
- Graph limits and exchangeable random graphs
- Szemerédi’s Regularity Lemma for Sparse Graphs
- Extremal problems on set systems
- Regularity Lemma for k-uniform hypergraphs
- Arithmetic progressions of length three in subsets of a random set
- Independent sets in hypergraphs
- Norm convergence of multiple ergodic averages for commuting transformations
- The counting lemma for regular k‐uniform hypergraphs
- Probabilistic Symmetries and Invariance Principles
- Quasi-random graphs
- Testing subgraphs in directed graphs
- A new proof of Szemerédi's theorem
This page was built for publication: An analytic approach to sparse hypergraphs: hypergraph removal
