Metraipolis › archive › dc_63fcf798b930
Spectral extremal hypergraphs without long Berge cycles — arXiv:2609.25030
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.25030
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T15:55:39.968Z
- SHA-256 of the archived text
49bdc40b77406ef41b06d40501478d847c28a7b192d17e856de7ee842bfddb56- Stable URL of this page
https://metraipolis.com/documento/dc_63fcf798b930
How to cite
Spectral extremal hypergraphs without long Berge cycles — arXiv:2609.25030 — arXiv (en), https://arxiv.org/abs/2609.25030 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_63fcf798b930 (Metraipolis archive dc_63fcf798b930, sha256 49bdc40b77406ef41b06d40501478d847c28a7b192d17e856de7ee842bfddb56)
BibTeX
@misc{dc63fcf798b930,
title = {Spectral extremal hypergraphs without long Berge cycles — arXiv:2609.25030},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.25030},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_63fcf798b930; sha256 49bdc40b77406ef41b06d40501478d847c28a7b192d17e856de7ee842bfddb56},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25030. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 hypergraph consists of all $r$-sets containing at most one vertex outside a fixed $s$-set. If $k=2s+2$ is even, one additionally includes all $r$-sets containing a fixed pair outside the $s$-set together with $r-2$ vertices inside it. Consequently, the maximum spectral radius is given as \[ \operatorname{spex}_r(n,k) = \left[ \binom{s}{r-1} \left(\frac{r-1}{s}\right)^{(r-1)/r} +o(1) \right]n^{(r-1)/r}. \]
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.25030 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T15:16:21.648Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).