Metraipolis › archive › dc_333f915aa751

Positive discrepancy of graphs far from Turán graphs — arXiv:2610.02681

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.02681
License (as archived)
CC0-1.0
Archived
2026-10-06T08:24:47.155Z
SHA-256 of the archived text
b622a947df7a77c7b91c328482f891c9764cab5f641369b11cdf3eb1aa42f170
Stable URL of this page
https://metraipolis.com/documento/dc_333f915aa751

How to cite

Positive discrepancy of graphs far from Turán graphs — arXiv:2610.02681 — arXiv (en), https://arxiv.org/abs/2610.02681 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_333f915aa751 (Metraipolis archive dc_333f915aa751, sha256 b622a947df7a77c7b91c328482f891c9764cab5f641369b11cdf3eb1aa42f170)
BibTeX
@misc{dc333f915aa751,
  title = {Positive discrepancy of graphs far from Turán graphs — arXiv:2610.02681},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.02681},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_333f915aa751; sha256 b622a947df7a77c7b91c328482f891c9764cab5f641369b11cdf3eb1aa42f170},
  year = {2026}
}

Archived text

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

We prove that, for every $\eps>0$, any $n$-vertex graph that needs at least $\eps n^2$ edge changes to become a Turán graph has positive discrepancy at least $c_\eps n^{5/4}$. Consequently, every such regular graph has second eigenvalue at least $c'_\eps n^{1/4}$. These results prove two conjectures of Räty, Sudakov and Tomon.

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.02681 — 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.293Z 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).