| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651927 | Electronic Notes in Discrete Mathematics | 2015 | 5 Pages |
Abstract
We develop a theory of regularity inheritance in 3-uniform hypergraphs. As a simple consequence we deduce a strengthening of a counting lemma of Frankl and Rödl. We believe that the approach is sufficiently flexible and general to permit extensions of our results in the direction of a hypergraph blow-up lemma.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
