Paperlane

no. 13 · Wednesday 11 November 2026

Berge Pancyclic hypergraphs

Teegan Bailey, Yupei Li and Ruth Luo

math.CO · v2

Abstract

An $n$-vertex graph $G$ is {\em pancyclic} if for every $\ell$, $3\leq \ell \leq n$, $G$ contains a cycle of length $\ell$. We consider an analog for hypergraphs. An $r$-uniform hypergraph is a set of vertices and a set of edges in which every edge contains $r$ vertices. A Berge cycle of length $\ell$ in a hypergraph is an alternating sequence of $\ell$ distinct vertices and $\ell$ distinct edges $v_1,e_1,v_2, \ldots, v_\ell, e_{\ell},v_1$ such that $\{v_i, v_{i+1}\} \subseteq e_i$ for all $i$, with indices taken modulo $\ell$. We similarly call a hypergraph {\em Berge pancyclic} if it contains Berge cycles of every possible length. For sufficiently large $n$ we prove a sharp minimum degree condition guaranteeing Berge pancyclicity in $r$-uniform hypergraphs where $3 \leq r \leq \lfloor (n-1)/2\rfloor - 2$. This bound is optimal for all such combinations of $n$ and $r$.

comments
Final version. Published in Proceedings of AMS
fields
Combinatorics
pdf ↗ page arXiv:2410.21733 ↗