On characterizing hypergraph regularity

DOI10.1002/RSA.10058MaRDI QIDQ4798170zbMATH OpenOpenAlexFDO

Authors Y. Dementieva, Penny Haxell, B. Nagle, 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

blow-up lemmaSzemerédi's regularity lemmaalgorithmic regularity lemmaFrankl-Rödl's regularity lemma

Mathematics Subject Classification ID

Hypergraphs (05C65)

Recommendations

• An Algorithmic Version of the Hypergraph Regularity Method
• Regular Partitions of Hypergraphs: Regularity Lemmas
• An Algorithmic Regularity Lemma for Hypergraphs
• An algorithmic hypergraph regularity lemma
• An Algorithmic Hypergraph Regularity Lemma

Cites work

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

Cited in

(14)

• Hypergraph limits: A regularity approach
• Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
• Density and regularity theorems for semi-algebraic hypergraphs
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• scientific article; zbMATH DE number 780943 (Why is no real title available?)
• An Algorithmic Hypergraph Regularity Lemma
• On characterizing hypergraph regularity
• Counting in hypergraphs via regularity inheritance
• Counting subgraphs in quasi‐random 4‐uniform hypergraphs
• Equivalent regular partitions of three-uniform hypergraphs
• Constructive Packings of Triple Systems
• Hypergraphs, quasi-randomness, and conditions for regularity
• A hypergraph blow-up lemma
• Hypergraph regularity and quasi-randomness

This page was built for publication: On characterizing hypergraph regularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798170)