Metraipolis › archive › dc_8ce36d63e6df

Supersaturation: Cliques and Positive Square Energy — arXiv:2610.40570

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.40570
License (as archived)
CC0-1.0
Archived
2026-11-01T02:38:08.905Z
SHA-256 of the archived text
69bcbae1c9bad98ec9e2d1c685dc3908244301eac8c3fea6d60747a950966d58
Stable URL of this page
https://metraipolis.com/documento/dc_8ce36d63e6df

How to cite

Supersaturation: Cliques and Positive Square Energy — arXiv:2610.40570 — arXiv (en), https://arxiv.org/abs/2610.40570 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8ce36d63e6df (Metraipolis archive dc_8ce36d63e6df, sha256 69bcbae1c9bad98ec9e2d1c685dc3908244301eac8c3fea6d60747a950966d58)
BibTeX
@misc{dc8ce36d63e6df,
  title = {Supersaturation: Cliques and Positive Square Energy — arXiv:2610.40570},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40570},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8ce36d63e6df; sha256 69bcbae1c9bad98ec9e2d1c685dc3908244301eac8c3fea6d60747a950966d58},
  year = {2026}
}

Archived text

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

Let $G$ be a simple graph of order $n$ and let $k_r$ denote the number of unlabeled copies of $K_r$ in $G$. Let $s^+$ denote the sum of the squares of the positive adjacency eigenvalues of $G$. For every fixed integer $r\geq2$, we prove that, as $n \to \infty$ \[ \sqrt{s^+}>\left(1-\frac1r\right)n \quad\Longrightarrow\quad k_{r+1}\geq \left(\frac1{r^{r-1}}-o_r(1)\right)n^{r-1}. \] The coefficient $r^{-(r-1)}$ is asymptotically best possible; in particular, the triangle case gives $k_3\geq n/2-o(n)$. The proof combines positive square energy stability, the clique removal lemma, and a sharp clique count around a maximum $r$-cut. The triangle case requires an additional block-matrix argument.

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.40570 — 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-01T02:15:28.297Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).