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
Copy

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
Keywords Hypergraph regularity,counting lemma,regularity inheritance
Departments Mathematics
DOI 10.1016/j.endm.2015.06.058
Date Deposited 19 Jan 2016 15:46
URI https://researchonline.lse.ac.uk/id/eprint/65062

Explore Further

picture_as_pdf
subject
Accepted Version
Download

Atom BibTeX OpenURL ContextObject in Span OpenURL ContextObject Dublin Core MPEG-21 DIDL Data Cite XML EndNote HTML Citation METS MODS RIOXX2 XML Reference Manager Refer ASCII Citation
Export

Downloads