Benjamini–Tzalik maximum-shortest-paths conjecture
Statement
For every finite multigraph of maximum degree at most , and every pair of vertices with graph distance , the number of shortest – paths satisfies .
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.