A sparse regular approximation lemma
From MaRDI portal
Publication:4633762
DOI10.1090/tran/7414zbMath1410.05171arXiv1610.02676OpenAlexW2963858807WikidataQ125028732 ScholiaQ125028732MaRDI QIDQ4633762
Publication date: 6 May 2019
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.02676
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal combinatorics (05D99)
Related Items (5)
A unified view of graph regularity via matrix decompositions ⋮ Local-vs-global combinatorics ⋮ The Induced Removal Lemma in Sparse Graphs ⋮ Estimating parameters associated with monotone properties ⋮ A tight bound for hypergraph regularity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new proof of the graph removal lemma
- A short proof of Gowers' lower bound for the regularity lemma
- A variant of the hypergraph removal lemma
- Szemerédi's lemma for the analyst
- Quick approximation to matrices and applications
- Lower bounds of tower type for Szemerédi's uniformity lemma
- Bounds for graph regularity and removal lemmas
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Graph removal lemmas
- Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
- Entropy and Information Theory
- Extremal problems on set systems
- Regularity Lemma for k-uniform hypergraphs
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
- Probability Inequalities for Sums of Bounded Random Variables
- Regular Partitions of Hypergraphs: Regularity Lemmas
- The counting lemma for regular k‐uniform hypergraphs
- Efficient testing of large graphs
This page was built for publication: A sparse regular approximation lemma
