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

Preview

PDF - Accepted Version Download (412kB) | Preview

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
Date Deposited:	19 Jan 2016 15:46
Last Modified:	12 Dec 2024 00:58
URI:	http://eprints.lse.ac.uk/id/eprint/65062

Actions (login required)

View Item