Cookies?
Library Header Image
LSE Research Online LSE Library Services

Counting in hypergraphs via regularity inheritance

Davies, Ewan (2015) Counting in hypergraphs via regularity inheritance. Electronic Notes in Discrete Mathematics, 49. pp. 413-417. ISSN 1571-0653

[img]
Preview
PDF - Accepted Version
Download (412kB) | Preview
Identification Number: 10.1016/j.endm.2015.06.058

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.

Item Type: Article
Official URL: http://www.sciencedirect.com/science/journal/15710...
Additional Information: © 2015 Elsevier B.V
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Sets: Departments > Mathematics
Date Deposited: 19 Jan 2016 15:46
Last Modified: 20 Mar 2019 02:46
URI: http://eprints.lse.ac.uk/id/eprint/65062

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics