## Abstract

Given α>0 and an integer ℓ≥5, we prove that every sufficiently large 3 -uniform hypergraph H on n vertices in which every two vertices are contained in at least αn

edges contains a copy of C−ℓ , a tight cycle on ℓ vertices minus one edge. This improves a previous result by Balogh, Clemen, and Lidický.

edges contains a copy of C−ℓ , a tight cycle on ℓ vertices minus one edge. This improves a previous result by Balogh, Clemen, and Lidický.

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

Pages (from-to) | 1-4 |

Journal | Combinatorics, Probability and Computing |

Early online date | 5 Jul 2023 |

DOIs | |

Publication status | E-pub ahead of print - 5 Jul 2023 |

## Keywords

- codegree density
- hypergraphs