Regularity Lemma for k-uniform hypergraphs
From MaRDI portal
Recommendations
Cites work
- An Algorithmic Regularity Lemma for Hypergraphs
- Excluding Induced Subgraphs III: A General Asymptotic
- Extremal problems on set systems
- scientific article; zbMATH DE number 3523693 (Why is no real title available?)
- Quick approximation to matrices and applications
- Regularity lemmas for hypergraphs and quasi-randomness
- Regularity properties for triple systems
- The uniformity lemma for hypergraphs
Cited in
(only showing first 100 items - show all)- Hereditary properties of hypergraphs
- The uniformity lemma for hypergraphs
- Additive combinatorics and graph theory
- The number of 3-SAT functions
- Regularity lemmas for clustering graphs
- 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
- Dirac-type theorems in random hypergraphs
- 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
- 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
- Ramsey classes of topological and metric spaces
- Extremal results in sparse pseudorandom graphs
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- The Gaussian primes contain arbitrarily shaped constellations
- Roth-type theorems in finite groups
- On the algebraic and topological structure of the set of Turán densities
- Tiling multipartite hypergraphs in quasi-random hypergraphs
- Regular subgraphs of uniform hypergraphs
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- σ-algebras for quasirandom hypergraphs
- Testability and repair of hereditary hypergraph properties
- The 3-colour Ramsey number of a 3-uniform Berge cycle
- A hypergraph blow-up lemma
- Weak quasi-randomness for uniform hypergraphs
- 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
- Counting in hypergraphs via regularity inheritance
- Regular slices for hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Combinatorial theorems in sparse random sets
- A hypergraph regularity method for generalized Turán problems
- Improved monochromatic loose cycle partitions in hypergraphs
- Regularity lemmas for hypergraphs and quasi-randomness
- A new proof of the density Hales-Jewett theorem
- Regularity properties for triple systems
- An algorithmic hypergraph regularity lemma
- A measure-theoretic approach to the theory of dense hypergraphs
- A sparse regular approximation lemma
- An analytic approach to sparse hypergraphs: hypergraph removal
- Counting subgraphs in quasi‐random 4‐uniform hypergraphs
- On the KŁR conjecture in random graphs
- 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
- Hypergraph removal lemmas via robust sharp threshold theorems
- Tight cycles and regular slices in dense hypergraphs
- The symmetry preserving removal Lemma
- Edge correlations in Random regular hypergraphs and applications to subgraph testing
- The poset of hypergraph quasirandomness
- An asymptotic multipartite Kühn-Osthus theorem
- The (7, 4)-Conjecture in Finite Groups
- On the Chromatic Thresholds of Hypergraphs
- The hypergraph regularity method and its applications
- Constructive packings by linear hypergraphs
- An arithmetic transference proof of a relative Szemerédi theorem
- Regular Partitions of Hypergraphs: Regularity Lemmas
- What is good mathematics?
- The counting lemma for regular k‐uniform hypergraphs
- Applications of the regularity lemma for uniform hypergraphs
- A geometric theory for hypergraph matching
- 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
- 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
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- Hypergraph regularity and random sampling
- Minimum degree conditions for tight Hamilton cycles
- FF‐factors in Quasi‐random Hypergraphs
- Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL
- Subsets of without L-shaped configurations
- Some Cubic Time Regularity Algorithms for Triple Systems
- Restricted problems in extremal combinatorics
- Local-vs-global combinatorics
- Loose Hamilton cycles in hypergraphs
- Sparse partition universal graphs for graphs of bounded degree
- A new proof of the graph removal lemma
- Resilience for tight Hamiltonicity
- On some extremal results for order types
- An improved bound for regular decompositions of 3-uniform hypergraphs of bounded \(\mathrm{VC}_2\)-dimension
- On the threshold for Szemerédi's theorem with random differences
- Equivalent regular partitions of three-uniform hypergraphs
This page was built for publication: Regularity Lemma for k-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4810506)
