An analytic approach to sparse hypergraphs: hypergraph removal
From MaRDI portal
Abstract: The use of tools from analysis to approach problems in graph theory has become an active area of research. Usually such methods are applied to problems involving dense graphs and hypergraphs; here we give the an extension of such methods to sparse but pseudorandom hypergraphs. We use this framework to give a proof of hypergraph removal for sub-hypergraphs of sparse random hypergraphs.
Recommendations
- L_p regular sparse hypergraphs
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- Density theorems and extremal hypergraph problems
- Extremal results in sparse pseudorandom graphs
- A measure-theoretic approach to the theory of dense hypergraphs
Cites work
- σ-algebras for quasirandom hypergraphs
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- A measure-theoretic approach to the theory of dense hypergraphs
- A new proof of Szemerédi's theorem
- A new proof of the graph removal lemma
- A point of view on Gowers uniformity norms
- A relative Szemerédi theorem
- A variant of the hypergraph removal lemma
- An approximate logic for measures
- An infinitesimal approach to stochastic analysis
- Arithmetic progressions of length three in subsets of a random set
- Combinatorial theorems in sparse random sets
- Convergence of diagonal ergodic averages
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Extremal problems on set systems
- Extremal results in sparse pseudorandom graphs
- Graph limits and exchangeable random graphs
- scientific article; zbMATH DE number 5853068 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3657792 (Why is no real title available?)
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 1222940 (Why is no real title available?)
- Hypergraph containers
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hypergraphs, quasi-randomness, and conditions for regularity
- Independent sets in hypergraphs
- Limits of dense graph sequences
- Nonconventional ergodic averages and nilmanifolds
- Norm convergence of multiple ergodic averages for commuting transformations
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- On limits of finite graphs
- On the KŁR conjecture in random graphs
- Probabilistic Symmetries and Invariance Principles
- Quasi-random graphs
- Quasi-random hypergraphs
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Regularity Lemma for k-uniform hypergraphs
- Representations for partially exchangeable arrays of random variables
- Sparse quasi-random graphs
- Stable group theory and approximate subgroups
- Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence
- Szemerédi's lemma for the analyst
- Szemerédi’s Regularity Lemma for Sparse Graphs
- Testability and repair of hereditary hypergraph properties
- Testing subgraphs in directed graphs
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- The counting lemma for regular k‐uniform hypergraphs
- The Gaussian primes contain arbitrarily shaped constellations
- The primes contain arbitrarily long arithmetic progressions
- The primes contain arbitrarily long polynomial progressions
- Turán's theorem for pseudo-random graphs
- Weak quasi-randomness for uniform hypergraphs
Cited in
(7)- A relative Szemerédi theorem
- scientific article; zbMATH DE number 5354839 (Why is no real title available?)
- A measure-theoretic approach to the theory of dense hypergraphs
- \(L_p\) regular sparse hypergraphs: box norms
- Higher amalgamation properties in measured structures
- On the non-measurability of -categorical Hrushovski constructions
- A removal lemma for ordered hypergraphs
This page was built for publication: An analytic approach to sparse hypergraphs: hypergraph removal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645028)
