Metraipolis › archive › dc_f03bfd8d0ca3
Optimal spectral supersaturation for cliques and odd cycles — arXiv:2610.06038
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.06038
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T16:52:19.066Z
- SHA-256 of the archived text
4193b0de5dfd31724f92a58085d00e1098cbbaa1ae6a8fe1c6f05b169511e385- Stable URL of this page
https://metraipolis.com/documento/dc_f03bfd8d0ca3
How to cite
Optimal spectral supersaturation for cliques and odd cycles — arXiv:2610.06038 — arXiv (en), https://arxiv.org/abs/2610.06038 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f03bfd8d0ca3 (Metraipolis archive dc_f03bfd8d0ca3, sha256 4193b0de5dfd31724f92a58085d00e1098cbbaa1ae6a8fe1c6f05b169511e385)
BibTeX
@misc{dcf03bfd8d0ca3,
title = {Optimal spectral supersaturation for cliques and odd cycles — arXiv:2610.06038},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.06038},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f03bfd8d0ca3; sha256 4193b0de5dfd31724f92a58085d00e1098cbbaa1ae6a8fe1c6f05b169511e385},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06038. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $Y_{n,r,q}$ be the graph obtained from the Turán graph $T_{n,r}$ by adding $q$ pairwise disjoint edges inside a largest part, and let $c(n,F)$ be the minimum number of copies of $F$ created by adding a single edge to $T_{n,r}$. Fang, Li, Lin and Ma proved that for every color-critical graph $F$ with $\chi (F)=r+1$, there exists a constant $\delta_F>0$ such that for all sufficiently large $n$ and all $1\le q\le \delta_F \sqrt{n}$, the condition $\lambda(G)\ge\lambda(Y_{n,r,q})$ forces at least $q\, c(n,F)$ copies of $F$. The bound $q=O(\sqrt{n}\,)$ is tight up to a constant factor, in contrast to the linear order $n$ of the edge setting of Mubayi, Pikhurko and Yilma, but the exact constant $\delta_F$ remained unknown for any $F$. In this paper, building on a structural result of Fang, Li, Lin and Ma, we determine the threshold $\delta_F$ when $F$ is a clique and an odd cycle. For every $r\ge2$, we denote $\delta_r :=(1-\tfrac1r)\sqrt2$ and prove that for every $\varepsilon>0$, if $n$ is sufficiently large and $1\le q\le(\delta_r-\varepsilon)\sqrt n$, then every $n$-vertex graph $G$ with $\lambda(G)\ge\lambda(Y_{n,r,q})$ contains at least $q\,c(n,K_{r+1})$ copies of $K_{r+1}$, and $\delta_r$ is best possible. For odd cycles, the threshold is $1/\sqrt2$. For every $k\ge1$ and $\varepsilon>0$, if $n$ is sufficiently large and $1\le q\le(1/\sqrt2-\varepsilon)\sqrt n$, then every $n$-vertex graph $G$ with $\lambda(G)\ge\lambda(Y_{n,2,q})$ contains at least $q\,c(n,C_{2k+1})$ copies of $C_{2k+1}$, and $1/\sqrt2$ is best possible. Our results determine both the exact count of copies and the optimal range of $q$. The behavior in the spectral setting differs from the classical edge setting, in which the range of $q$ is of order $n$ and the threshold is $1/r$ for cliques by Lovász and Simonovits, and $1/2$ for odd cycles by Pikhurko and Yilma.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.06038 — 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-06T15:19:20.011Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).