Counting in hypergraphs via regularity inheritance
Davies, E.
(2015).
Counting in hypergraphs via regularity inheritance.
Electronic Notes in Discrete Mathematics,
49, 413-417.
https://doi.org/10.1016/j.endm.2015.06.058
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.
| Item Type | Article |
|---|---|
| Copyright holders | © 2015 Elsevier B.V |
| Departments | LSE > Academic Departments > Mathematics |
| DOI | 10.1016/j.endm.2015.06.058 |
| Date Deposited | 19 Jan 2016 |
| URI | https://researchonline.lse.ac.uk/id/eprint/65062 |
Explore Further
- https://www.scopus.com/pages/publications/84947722432 (Scopus publication)
- http://www.sciencedirect.com/science/journal/15710... (Official URL)