The counting lemma for regular k‐uniform hypergraphs
From MaRDI portal
Publication:5469145
Recommendations
Cites work
- A density version of the Hales-Jewett theorem
- Arithmetic Progressions in Sets with Small Sumsets
- Dense Arrangements are Locally Very Dense. I
- Density theorems and extremal hypergraph problems
- scientific article; zbMATH DE number 5130822 (Why is no real title available?)
- Integer and fractional packings of hypergraphs
Cited in
(only showing first 100 items - show all)- Hereditary properties of hypergraphs
- On the Ramsey number of sparse 3-graphs
- A combinatorial proof of the removal lemma for groups
- The uniformity lemma for hypergraphs
- Lower bounds of tower type for Szemerédi's uniformity lemma
- Additive combinatorics and graph theory
- A multidimensional Szemerédi theorem in the primes via combinatorics
- A removal lemma for systems of linear equations over finite fields
- An approximate logic for measures
- Tournament quasirandomness from local counting
- Hypergraphs without exponents
- A new bound for the Brown-Erdős-Sós problem
- No additional tournaments are quasirandom-forcing
- The number of k-dimensional corner-free subsets of grids
- Efficient removal lemmas for matrices
- On arithmetic progressions in symmetric sets in finite field model
- Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs
- Szemerédi's proof of Szemerédi's theorem
- Sparse hypergraphs: new bounds and constructions
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- On \(k\)-uniform random hypergraphs without generalized fans
- A weighted regularity lemma with applications
- Analytic methods for uniform hypergraphs
- A tight bound for hypergraph regularity
- A relative Szemerédi theorem
- Density theorems and extremal hypergraph problems
- Counting results for sparse pseudorandom hypergraphs. I.
- Counting results for sparse pseudorandom hypergraphs. II.
- Approximate counting of regular hypergraphs
- Extremal results in sparse pseudorandom graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- Roth-type theorems in finite groups
- On the algebraic and topological structure of the set of Turán densities
- Sum-avoiding sets in groups
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- Testability and repair of hereditary hypergraph properties
- A hypergraph blow-up lemma
- The quasi-randomness of hypergraph cut properties
- Testing Odd-Cycle-Freeness in Boolean Functions
- Generalizations of Fourier analysis, and how to apply them
- On replica symmetry of large deviations in random graphs
- Hypergraph limits: A regularity approach
- Counting in hypergraphs via regularity inheritance
- Regular slices for hypergraphs
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Combinatorial theorems in sparse random sets
- A probabilistic counting Lemma for complete graphs
- An Abstract Szemerédi Regularity Lemma
- Saturating Sperner families
- Regularity lemmas for hypergraphs and quasi-randomness
- A new proof of the density Hales-Jewett theorem
- Regularity properties for triple systems
- A measure-theoretic approach to the theory of dense hypergraphs
- Constructive Packings of Triple Systems
- A sparse regular approximation lemma
- An analytic approach to sparse hypergraphs: hypergraph removal
- Counting subgraphs in quasi‐random 4‐uniform hypergraphs
- Counting Small Cliques in 3-uniform Hypergraphs
- On the KŁR conjecture in random graphs
- Regularity Lemma for k-uniform hypergraphs
- Counting substructures. II: Hypergraphs
- Testing Linear-Invariant Non-linear Properties: A Short Report
- Green's conjecture and testing linear invariant properties
- Bounding the number of hyperedges in friendship \(r\)-hypergraphs
- Efficient removal lemmas for matrices
- Turán number of bipartite graphs with no \(K_{t,t}\)
- Hypergraph removal lemmas via robust sharp threshold theorems
- Tight cycles and regular slices in dense hypergraphs
- The symmetry preserving removal Lemma
- On random sampling in uniform hypergraphs
- The poset of hypergraph quasirandomness
- The (7, 4)-Conjecture in Finite Groups
- On the Chromatic Thresholds of Hypergraphs
- The hypergraph regularity method and its applications
- Norm convergence of multiple ergodic averages for commuting transformations
- An arithmetic transference proof of a relative Szemerédi theorem
- Stability results for random discrete structures
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regular Partitions of Hypergraphs: Counting Lemmas
- What is good mathematics?
- Applications of the regularity lemma for uniform hypergraphs
- From harmonic analysis to arithmetic combinatorics
- Testing odd-cycle-freeness in Boolean functions
- A blurred view of Van der Waerden type theorems
- Ramsey numbers of sparse hypergraphs
- Holes in graphs
- Graph norms and Sidorenko's conjecture
- On 3‐graphs with no four vertices spanning exactly two edges
- SZEMERÉDI’S THEOREM: AN EXPLORATION OF IMPURITY, EXPLANATION, AND CONTENT
- Quasirandom-Forcing Orientations of Cycles
- Hypergraph regularity and random sampling
- Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL
- Subsets of without L-shaped configurations
- Restricted problems in extremal combinatorics
- Local-vs-global combinatorics
- Deducing the multidimensional Szemerédi theorem from an infinitary removal lemma
- Sparse partition universal graphs for graphs of bounded degree
- Deducing the density Hales-Jewett theorem from an infinitary removal lemma
This page was built for publication: The counting lemma for regular k‐uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5469145)
