An n n -vertex graph G G is pancyclic if for every ℓ, 3 ≤ ℓ ≤ n 3 n, G G contains a cycle of length ℓ. We consider an analog for hypergraphs. An r r -uniform hypergraph is a set of vertices and a set of edges in which every edge contains r r vertices. A Berge cycle of length ℓ in a hypergraph is an alternating sequence of ℓ distinct vertices and ℓ distinct edges v 1, e 1, v 2, …, v ℓ, e ℓ, v 1 v₁, e₁, v₂, , v_, e, v₁ such that { v i, v i + <mml: mn
Bailey et al. (Wed,) studied this question.