Library Header Image
LSE Research Online LSE Library Services

Tight cycles and regular slices in dense hypergraphs

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Cooley, Oliver and Mycroft, Richard (2017) Tight cycles and regular slices in dense hypergraphs. Journal of Combinatorial Theory, Series A, 149. pp. 30-100. ISSN 0097-3165

PDF - Accepted Version
Download (749kB) | Preview

Identification Number: 10.1016/j.jcta.2017.01.003


We study properties of random subcomplexes of partitions returned by (a suitable form of) the Strong Hypergraph Regularity Lemma, which we call regular slices. We argue that these subcomplexes capture many important structural properties of the original hypergraph. Accordingly we advocate their use in extremal hypergraph theory, and explain how they can lead to considerable simplifications in existing proofs in this field. We also use them for establishing the following two new results. Firstly, we prove a hypergraph extension of the Erd\H{o}s-Gallai Theorem: for every δ>0 every sufficiently large k-uniform hypergraph with at least (α+δ)(nk) edges contains a tight cycle of length αn for each α∈[0,1]. Secondly, we find (asymptotically) the minimum codegree requirement for a k-uniform k-partite hypergraph, each of whose parts has n vertices, to contain a tight cycle of length αkn, for each 0<α<1.

Item Type: Article
Official URL:
Additional Information: © 2017 Elsevier Inc.
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 22 Jun 2016 15:14
Last Modified: 20 Oct 2021 02:28

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics