A measure-theoretic approach to the theory of dense hypergraphs
| dc.creator | Elek, Gábor | |
| dc.creator | Szegedy, Balázs | |
| dc.date | 2008-10-22 | |
| dc.date | 2008-10-27 | |
| dc.date.accessioned | 2026-07-07T10:12:57Z | |
| dc.date.available | 2026-07-07T10:12:57Z | |
| dc.description | 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. | |
| dc.description | 49 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/0810.4062 | |
| dc.identifier | http://arxiv.org/abs/0810.4062 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/172364 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C99; 82B99 | |
| dc.title | A measure-theoretic approach to the theory of dense hypergraphs | |
| dc.type | text |