On characterizing hypergraph regularity

DOI10.1002/rsa.10058zbMath1015.05061OpenAlexW2163453622MaRDI QIDQ4798170

Y. Dementieva, Brendan Nagle, Penny E. Haxell, Vojtěch Rödl

Publication date: 19 March 2003

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10058

zbMATH Keywords

Szemerédi's regularity lemmablow-up lemmaalgorithmic regularity lemmaFrankl-Rödl's regularity lemma

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items

On characterizing hypergraph regularity ⋮ Counting in hypergraphs via regularity inheritance ⋮ Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree ⋮ Constructive Packings of Triple Systems ⋮ Counting subgraphs in quasi‐random 4‐uniform hypergraphs ⋮ A hypergraph blow-up lemma ⋮ Hypergraphs, quasi-randomness, and conditions for regularity

Cites Work

• Integer and fractional packings in dense graphs
• Near perfect coverings in graphs and hypergraphs
• The number of submatrices of a given type in a Hadamard matrix and related results
• Quick approximation to matrices and applications
• The uniformity lemma for hypergraphs
• Blow-up lemma
• Ramsey properties of random hypergraphs
• Pseudo-random hypergraphs
• Quasi-random hypergraphs
• Constructive Quasi-Ramsey Numbers and Tournament Ranking
• Random graphs with monochromatic triangles in every edge coloring
• The Algorithmic Aspects of the Regularity Lemma
• Regularity properties for triple systems
• Extremal problems on set systems
• Counting Small Cliques in 3-uniform Hypergraphs
• On characterizing hypergraph regularity
• Hereditary Properties of Triple Systems
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
• Threshold Functions for Ramsey Properties
• The asymptotic number of triple systems not containing a fixed one

This page was built for publication: On characterizing hypergraph regularity