The counting lemma for regular k‐uniform hypergraphs
From MaRDI portal
Publication:5469145
DOI10.1002/rsa.20117zbMath1093.05045OpenAlexW4251160190WikidataQ55953309 ScholiaQ55953309MaRDI QIDQ5469145
Brendan Nagle, Vojtěch Rödl, Mathias Schacht
Publication date: 16 May 2006
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20117
Related Items (91)
A blurred view of Van der Waerden type theorems ⋮ Additive combinatorics and graph theory ⋮ Testing Odd-Cycle-Freeness in Boolean Functions ⋮ Generalizations of Fourier analysis, and how to apply them ⋮ Density theorems and extremal hypergraph problems ⋮ Regular slices for hypergraphs ⋮ The number of \(k\)-dimensional corner-free subsets of grids ⋮ A variant of the hypergraph removal lemma ⋮ On replica symmetry of large deviations in random graphs ⋮ Hypergraph limits: A regularity approach ⋮ Combinatorial theorems in sparse random sets ⋮ Saturating Sperner families ⋮ Efficient Removal Lemmas for Matrices ⋮ A new generalization of Mantel's theorem to \(k\)-graphs ⋮ Efficient removal lemmas for matrices ⋮ On 3‐graphs with no four vertices spanning exactly two edges ⋮ SZEMERÉDI’S THEOREM: AN EXPLORATION OF IMPURITY, EXPLANATION, AND CONTENT ⋮ Constructive Packings of Triple Systems ⋮ Quasirandom-Forcing Orientations of Cycles ⋮ Hypergraph regularity and random sampling ⋮ A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing ⋮ Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡} ⋮ Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL ⋮ Deducing the multidimensional Szemerédi theorem from an infinitary removal lemma ⋮ Subsets of without L-shaped configurations ⋮ Restricted problems in extremal combinatorics ⋮ Local-vs-global combinatorics ⋮ On arithmetic progressions in symmetric sets in finite field model ⋮ Sparse partition universal graphs for graphs of bounded degree ⋮ The (7, 4)-Conjecture in Finite Groups ⋮ A new proof of the density Hales-Jewett theorem ⋮ On the Chromatic Thresholds of Hypergraphs ⋮ Deducing the density Hales-Jewett theorem from an infinitary removal lemma ⋮ A new proof of the graph removal lemma ⋮ A multidimensional Szemerédi theorem in the primes via combinatorics ⋮ A measure-theoretic approach to the theory of dense hypergraphs ⋮ Extremal results in sparse pseudorandom graphs ⋮ Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs ⋮ A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma ⋮ Szemerédi's proof of Szemerédi's theorem ⋮ Sparse hypergraphs: new bounds and constructions ⋮ Norm convergence of multiple ergodic averages for commuting transformations ⋮ On the KŁR conjecture in random graphs ⋮ A sparse regular approximation lemma ⋮ Counting substructures. II: Hypergraphs ⋮ Note on the 3-graph counting Lemma ⋮ Bounding the number of hyperedges in friendship \(r\)-hypergraphs ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ An analytic approach to sparse hypergraphs: hypergraph removal ⋮ An exact Turán result for the generalized triangle ⋮ On \(k\)-uniform random hypergraphs without generalized fans ⋮ An arithmetic transference proof of a relative Szemerédi theorem ⋮ Tight cycles and regular slices in dense hypergraphs ⋮ Analytic methods for uniform hypergraphs ⋮ Stability results for random discrete structures ⋮ A removal lemma for systems of linear equations over finite fields ⋮ Weak hypergraph regularity and linear hypergraphs ⋮ 3-uniform hypergraphs of bounded degree have linear Ramsey numbers ⋮ Testing Linear-Invariant Non-linear Properties: A Short Report ⋮ Green’s Conjecture and Testing Linear Invariant Properties ⋮ An approximate logic for measures ⋮ Erdős-Hajnal-type theorems in hypergraphs ⋮ The symmetry preserving removal lemma ⋮ Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs ⋮ Generalizations of the removal lemma ⋮ The effect of induced subgraphs on quasi-randomness ⋮ Testability and repair of hereditary hypergraph properties ⋮ On random sampling in uniform hypergraphs ⋮ Roth-type theorems in finite groups ⋮ Graph norms and Sidorenko's conjecture ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ What is good mathematics? ⋮ Tournament quasirandomness from local counting ⋮ Hereditary properties of hypergraphs ⋮ Ramsey numbers of sparse hypergraphs ⋮ Hypergraphs without exponents ⋮ Arithmetic progressions, different regularity lemmas and removal lemmas ⋮ On the Ramsey number of sparse 3-graphs ⋮ A combinatorial proof of the removal lemma for groups ⋮ A hypergraph blow-up lemma ⋮ Sum-avoiding sets in groups ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ The quasi-randomness of hypergraph cut properties ⋮ From harmonic analysis to arithmetic combinatorics ⋮ A tight bound for hypergraph regularity ⋮ Unnamed Item ⋮ A new bound for the Brown-Erdős-Sós problem ⋮ No additional tournaments are quasirandom-forcing ⋮ The poset of hypergraph quasirandomness ⋮ On the algebraic and topological structure of the set of Turán densities ⋮ A relative Szemerédi theorem
Cites Work
This page was built for publication: The counting lemma for regular k‐uniform hypergraphs
