Spectral extremal hypergraphs without long Berge cycles
Let $r\ge 3$ and $k\ge 2r+1$ be fixed integers. We determine, for all sufficiently large $n$, the maximum adjacency-tensor spectral radius of an $n$-vertex $r$-uniform hypergraph containing no Berge cycle of length at least $k$. Write $s=\left\lfloor\frac{k-1}{2}\right\rfloor$. If $k=2s+1$ is odd, the unique extremal h...