Metraipolis › archive › dc_b8ed498bc880
Strict spectral supersaturation for cliques: extremal graphs and sharp thresholds — arXiv:2610.03337
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.03337
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T08:25:14.224Z
- SHA-256 of the archived text
f18656bf2e563af4d81b39e8edf92a5fa8285991efc144d2ecd7adc950a4ac8c- Stable URL of this page
https://metraipolis.com/documento/dc_b8ed498bc880
How to cite
Strict spectral supersaturation for cliques: extremal graphs and sharp thresholds — arXiv:2610.03337 — arXiv (en), https://arxiv.org/abs/2610.03337 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b8ed498bc880 (Metraipolis archive dc_b8ed498bc880, sha256 f18656bf2e563af4d81b39e8edf92a5fa8285991efc144d2ecd7adc950a4ac8c)
BibTeX
@misc{dcb8ed498bc880,
title = {Strict spectral supersaturation for cliques: extremal graphs and sharp thresholds — arXiv:2610.03337},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.03337},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b8ed498bc880; sha256 f18656bf2e563af4d81b39e8edf92a5fa8285991efc144d2ecd7adc950a4ac8c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.03337. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For every fixed $r\ge3$ and all sufficiently large $n$, we determine the largest adjacency spectral radius of an $n$-vertex graph with fewer than $q c_r(n)$ copies of $K_{r+1}$, where $1\le q<n/r$. Here $c_r(n)$ is the number of copies created by adding one edge to a largest part of the Turán graph. We also determine all extremal graphs. In most cases the extremal graph is obtained from an almost balanced complete multipartite graph by adding a star in one part. Two small values of $q$ require separate constructions, and an additional transition occurs when $r=3$ and $n\equiv2\pmod3$. Under the non-strict constraint, the unique extremal graph is obtained by adding a $q$-edge star to a largest part of the Turán graph. We determine the difference between the strict and non-strict values and prove that the sharp matching threshold is $\sqrt2(r-1)/r$. The proof treats separately the ranges $q=o(n)$, $q/m\to\gamma\in(0,1)$, and $q/m\to1$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-05 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.03337 — 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-06T08:18:48.307Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).