Metraipolis › archive › dc_fa839b4cc684
Asymptotic stability of clique-saturating edges near Turán thresholds — arXiv:2610.40696
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40696
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T05:00:27.060Z
- SHA-256 of the archived text
e1fc51781ee56c4412244672b6273164a45f89b7eecb9a5c20eed1bee6fbadc2- Stable URL of this page
https://metraipolis.com/documento/dc_fa839b4cc684
How to cite
Asymptotic stability of clique-saturating edges near Turán thresholds — arXiv:2610.40696 — arXiv (en), https://arxiv.org/abs/2610.40696 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fa839b4cc684 (Metraipolis archive dc_fa839b4cc684, sha256 e1fc51781ee56c4412244672b6273164a45f89b7eecb9a5c20eed1bee6fbadc2)
BibTeX
@misc{dcfa839b4cc684,
title = {Asymptotic stability of clique-saturating edges near Turán thresholds — arXiv:2610.40696},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40696},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fa839b4cc684; sha256 e1fc51781ee56c4412244672b6273164a45f89b7eecb9a5c20eed1bee6fbadc2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40696. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $f_{p+1}(n,m)$ denote the minimum number of $K_{p+1}$-saturating edges in an $n$-vertex $K_{p+1}$-free graph with $m$ edges. In this paper, we investigate the stability of this parameter near the Turán thresholds, with particular emphasis on the role of the minimum degree. We introduce the refined parameter $f_{p+1,p}(n,m,\delta)$. It is defined for $K_{p+1}$-free graphs on $n$ vertices with $m$ edges, minimum degree $\delta$, and containing at least a copy of $K_p$. For every fixed integer $p\ge3$, we establish a stability result when the number of edges is $\mathrm{ex}(n,K_p)+o(n^2)$, showing that \[ f_{p+1,p} (n,m,\delta)=\left(\frac{(p-2)^2}{2(p-1)^3}+o(1)\right)n^2, \ \text{for }\ m=\mathrm{ex}(n,K_p)+o(n^2), \ \delta\geq \left(\frac{p-2}{p-1}+o(1)\right)n. \] We further obtain a stability theorem in the regime where the number of edges is quadratically smaller than $\operatorname{ex}(n,K_{p+1})$. More precisely, for $0 \leq c< \frac{1}{2p(3p-1)}$, \[ f_{p+1,p} (n,m,\delta)=\left(\frac{1}{2p}+o(1)\right)n^2, \ \text{for }\ m=\operatorname{ex}(n,K_{p+1})-(c+o(1))n^2, \ \delta\geq \left(\frac{p-1}{p}-2c+o(1)\right)n. \]
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.40696 — 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-11-02T04:47:57.656Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).