Metraipolis › archive › dc_77aed287f962

The Maximum Number of Shortest Paths in Graphs — arXiv:2609.02334

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.02334
License (as archived)
CC0-1.0
Archived
2026-10-17T05:33:01.030Z
SHA-256 of the archived text
8093642134f8f8ca4c3f8229e4ec44ac8104faf0cf61a4ea5e9746b3d342f529
Stable URL of this page
https://metraipolis.com/documento/dc_77aed287f962

How to cite

The Maximum Number of Shortest Paths in Graphs — arXiv:2609.02334 — arXiv (en), https://arxiv.org/abs/2609.02334 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_77aed287f962 (Metraipolis archive dc_77aed287f962, sha256 8093642134f8f8ca4c3f8229e4ec44ac8104faf0cf61a4ea5e9746b3d342f529)
BibTeX
@misc{dc77aed287f962,
  title = {The Maximum Number of Shortest Paths in Graphs — arXiv:2609.02334},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.02334},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_77aed287f962; sha256 8093642134f8f8ca4c3f8229e4ec44ac8104faf0cf61a4ea5e9746b3d342f529},
  year = {2026}
}

Archived text

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

Benjamini and Tzalik obtained an upper bound on the number of shortest paths between two vertices at distance $t$ in a multigraph of maximum degree at most $\Delta$, and proposed a conjecture on the sharp bound. In this paper, we develop a probabilistic counting argument based on probability distributions induced by random walks from the two endpoints. This approach yields a sharp bound for multigraphs and confirms their conjecture. We further determine the exact maximum for simple graphs and thus answer another question of Benjamini and Tzalik. We also investigate the equality cases, describing the structure of the subgraph formed by shortest paths between $x$ and $y$ and giving tight examples.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-03 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.02334 — 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-17T04:59:51.780Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).