### Abstract

Original language | English |
---|---|

Pages (from-to) | 30-100 |

Number of pages | 71 |

Journal | Journal of Combinatorial Theory / A |

Volume | 149 |

Publication status | Published - 2017 |

### Fingerprint

### Cite this

*Journal of Combinatorial Theory / A*,

*149*, 30-100.

**Tight cycles and regular slices in dense hypergraphs.** / Allen, Peter; Böttcher, Julia; Cooley, Oliver Josef Nikolaus; Mycroft, Richard.

Research output: Contribution to journal › Article › Research › peer-review

*Journal of Combinatorial Theory / A*, vol. 149, pp. 30-100.

}

TY - JOUR

T1 - Tight cycles and regular slices in dense hypergraphs

AU - Allen, Peter

AU - Böttcher, Julia

AU - Cooley, Oliver Josef Nikolaus

AU - Mycroft, Richard

PY - 2017

Y1 - 2017

N2 - 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˝os-Gallai Theorem: for every δ > 0 every sufficiently large k-uniform hypergraph with at least (α + δ)(n choose k) 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.

AB - 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˝os-Gallai Theorem: for every δ > 0 every sufficiently large k-uniform hypergraph with at least (α + δ)(n choose k) 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.

M3 - Article

VL - 149

SP - 30

EP - 100

JO - Journal of Combinatorial Theory / A

JF - Journal of Combinatorial Theory / A

SN - 0097-3165

ER -