arXiv (All)
open access
The Maximum Number of Shortest Paths in Graphs
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 $Δ$, and proposed a conjecture on the sharp bound. In this paper, we develop a probabilistic counting argument based on probability distribution
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Maximum Number of Shortest Paths in Graphs#919997
- Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics#66909
- A counterexample to the quantum Hedetniemi conjecture#1034490
- Logarithmic basis number of graphs and regular matroids#1084361
- CAPACITY AND FLOW ASSIGNMENTS IN LARGE COMPUTER NETWORKS#933595
Record · ID 924228
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive