A measure-theoretic approach to the theory of dense hypergraphs

Abstract

In this paper we develop a measure-theoretic method to treat problems in hypergraph theory. Our central theorem is a correspondence principle between three objects: An increasing hypergraph sequence, a measurable set in an ultraproduct space and a measurable set in a finite dimensional Lebesgue space. Using this correspondence principle we build up the theory of dense hypergraphs from scratch. Along these lines we give new proofs for the Hypergraph Removal Lemma, the Hypergraph Regularity Lemma, the Counting Lemma and the Testability of Hereditary Hypergraph Properties. We prove various new results including a strengthening of the Regularity Lemma and an Inverse Counting Lemma. We also prove the equivalence of various notions for convergence of hypergraphs and we construct limit objects for such sequences. We prove that the limit objects are unique up to a certain family of measure preserving transformations. As our main tool we study the integral and measure theory on the ultraproduct of finite measure spaces which is interesting on its own right.

49 pages, 1 figure

References in corpus (1)

• On the testability and repair of hereditary hypergraph properties

Cited by in corpus (9)

• Nilspaces, nilmanifolds and their morphisms
• On higher order Fourier analysis
• Graphons, cut norm and distance, couplings and rearrangements
• Limits of local-global convergent graph sequences
• Gowers norms, regularization and limits of functions on abelian groups
• The Space of Actions, Partition Metric and Combinatorial Rigidity
• Samplings and observables. Invariants of metric measure spaces
• The inducibility of blow-up graphs
• Quasi-random graphs and graph limits