Regularity Lemma for k-uniform hypergraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3523693 (Why is no real title available?)
- An Algorithmic Regularity Lemma for Hypergraphs
- Excluding Induced Subgraphs III: A General Asymptotic
- Extremal problems on set systems
- 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)- A hypergraph blow-up lemma
- Weak quasi-randomness for uniform hypergraphs
- Generalizations of Fourier analysis, and how to apply them
- What is good mathematics?
- Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs
- An arithmetic transference proof of a relative Szemerédi theorem
- F$F$‐factors in Quasi‐random Hypergraphs
- Note on the 3-graph counting Lemma
- Tight cycles and regular slices in dense hypergraphs
- An exact Turán result for the generalized triangle
- Szemerédi's proof of Szemerédi's theorem
- Sparse hypergraphs: new bounds and constructions
- On arithmetic progressions in symmetric sets in finite field model
- Additive combinatorics and graph theory
- Testing Odd-Cycle-Freeness in Boolean Functions
- Constructive packings by linear hypergraphs
- Packing \(k\)-partite \(k\)-uniform hypergraphs
- Edge correlations in Random regular hypergraphs and applications to subgraph testing
- No additional tournaments are quasirandom-forcing
- Hypergraph regularity and random sampling
- On 3‐graphs with no four vertices spanning exactly two edges
- On the Chromatic Thresholds of Hypergraphs
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- On replica symmetry of large deviations in random graphs
- Applications of the regularity lemma for uniform hypergraphs
- The counting lemma for regular k‐uniform hypergraphs
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Regular subgraphs of uniform hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Dirac-type theorems in random hypergraphs
- Testability and repair of hereditary hypergraph properties
- Sparse partition universal graphs for graphs of bounded degree
- Combinatorial theorems in sparse random sets
- Subsets of without L-shaped configurations
- Graph norms and Sidorenko's conjecture
- The poset of hypergraph quasirandomness
- A measure-theoretic approach to the theory of dense hypergraphs
- Generalizations of the removal lemma
- A geometric theory for hypergraph matching
- Ramsey classes of topological and metric spaces
- Improved monochromatic loose cycle partitions in hypergraphs
- Hereditary properties of hypergraphs
- On the algebraic and topological structure of the set of Turán densities
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Integer and fractional packings of hypergraphs
- Testing Linear-Invariant Non-linear Properties: A Short Report
- Weak hypergraph regularity and linear hypergraphs
- Quasirandom-Forcing Orientations of Cycles
- A weighted regularity lemma with applications
- Regularity lemmas for clustering graphs
- SZEMERÉDI’S THEOREM: AN EXPLORATION OF IMPURITY, EXPLANATION, AND CONTENT
- Regularity properties for triple systems
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL
- Testing odd-cycle-freeness in Boolean functions
- Density theorems and extremal hypergraph problems
- A blurred view of Van der Waerden type theorems
- A tight bound for hypergraph regularity
- Resilience for tight Hamiltonicity
- σ-algebras for quasirandom hypergraphs
- Tournament quasirandomness from local counting
- A new proof of the density Hales-Jewett theorem
- Arithmetic progressions, different regularity lemmas and removal lemmas
- Counting in hypergraphs via regularity inheritance
- Regular slices for hypergraphs
- Analytic methods for uniform hypergraphs
- Roth-type theorems in finite groups
- Some Cubic Time Regularity Algorithms for Triple Systems
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- A relative Szemerédi theorem
- On some extremal results for order types
- Minimum degree conditions for tight Hamilton cycles
- A sparse regular approximation lemma
- The hypergraph regularity method and its applications
- Erdős-Hajnal-type theorems in hypergraphs
- A variant of the hypergraph removal lemma
- Loose Hamilton cycles in hypergraphs
- A new proof of the graph removal lemma
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- Hypergraphs without exponents
- Counting subgraphs in quasi‐random 4‐uniform hypergraphs
- Local-vs-global combinatorics
- Restricted problems in extremal combinatorics
- 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
- The number of 3-SAT functions
- Hypergraph removal lemmas via robust sharp threshold theorems
- Colouring versus density in integers and Hales-Jewett cubes
- Ramsey numbers of sparse hypergraphs
- Extremal results in sparse pseudorandom graphs
- Tiling multipartite hypergraphs in quasi-random hypergraphs
- Green's conjecture and testing linear invariant properties
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- Equivalent regular partitions of three-uniform hypergraphs
- The (7, 4)-Conjecture in Finite Groups
- The 3-colour Ramsey number of a 3-uniform Berge cycle
- Efficient removal lemmas for matrices
- From harmonic analysis to arithmetic combinatorics
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)
