Metraipolis › archive › dc_acafbcf8a39f
Improved Bounds on the Szeged-Wiener Gap and the BKLPS Conjecture — arXiv:2609.20025
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20025
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T04:47:07.029Z
- SHA-256 of the archived text
09a38c51950a81bade7940b3e24e1f8347e43a72344e8e8aece42a3bad943bdb- Stable URL of this page
https://metraipolis.com/documento/dc_acafbcf8a39f
How to cite
Improved Bounds on the Szeged-Wiener Gap and the BKLPS Conjecture — arXiv:2609.20025 — arXiv (en), https://arxiv.org/abs/2609.20025 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_acafbcf8a39f (Metraipolis archive dc_acafbcf8a39f, sha256 09a38c51950a81bade7940b3e24e1f8347e43a72344e8e8aece42a3bad943bdb)
BibTeX
@misc{dcacafbcf8a39f,
title = {Improved Bounds on the Szeged-Wiener Gap and the BKLPS Conjecture — arXiv:2609.20025},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20025},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_acafbcf8a39f; sha256 09a38c51950a81bade7940b3e24e1f8347e43a72344e8e8aece42a3bad943bdb},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20025. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Bonamy-Knor-Lužar-Pinlou-Škrekovski (2017) define $K_n^t$ to be the complete graph of $n-1$ vertices but with an extra vertex that's adjacent to $t$ vertices of the complete graph part. They propose a stronger conjecture which asserts that if $G$ is a finite simple $2$-connected graph of order $n \ge 10$ not isomorphic to $K_n$, $K_n^2$, nor $K_n^{n-2}$, then the Szeged-Wiener gap of $G$ is $\eta(G) \ge 2n$. We improve upon their work to tighten the bounds on the Szeged-Wiener gap, allowing us to prove this conjecture in the affirmative. Afterwards, we construct graphs attaining equality for each $n \ge 10$ and pose a problem for interested readers to determine a necessary and sufficient condition for equality.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.20025 — 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-10T04:15:33.131Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).