Metraipolis › archive › dc_680c5d72cd1b

Extremal graphs for the $k$-th eigenvalue — arXiv:2608.03196

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.03196
License (as archived)
CC0-1.0
Archived
2026-10-31T12:55:46.947Z
SHA-256 of the archived text
4c9b192653871831ac4db3186e6aa659052b50df9da6d060114ee7a38c853a94
Stable URL of this page
https://metraipolis.com/documento/dc_680c5d72cd1b

How to cite

Extremal graphs for the $k$-th eigenvalue — arXiv:2608.03196 — arXiv (en), https://arxiv.org/abs/2608.03196 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_680c5d72cd1b (Metraipolis archive dc_680c5d72cd1b, sha256 4c9b192653871831ac4db3186e6aa659052b50df9da6d060114ee7a38c853a94)
BibTeX
@misc{dc680c5d72cd1b,
  title = {Extremal graphs for the $k$-th eigenvalue — arXiv:2608.03196},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.03196},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_680c5d72cd1b; sha256 4c9b192653871831ac4db3186e6aa659052b50df9da6d060114ee7a38c853a94},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03196. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For a simple graph $G$ of order $n$, let $\lambda_1(G)\ge \cdots \ge \lambda_n(G)$ denote its adjacency eigenvalues. Hong's problem asks for the optimal upper bound for $\lambda_k(G)$. A recent theorem of Sivashankar gives, for every $k\ge3$, \[ \lambda_k(G)\le \frac{(k-2)\sqrt{k+1}+2}{2k(k-1)}\,n-1, \] with sharp examples arising from maximal real equiangular tight frames. In this paper, we characterize the equality case. We also obtain an explicit combinatorial description of the extremal graphs for $\lambda_3$ and $\lambda_4$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-05 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.03196 — 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-31T12:42:47.764Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).