Three-path conjecture for the maximum gap between average distance and proximity
Statement
Let be a connected graph on vertices. Let denote its average distance and let denote its proximity, the minimum average distance from a vertex to all other vertices.
Three-path conjecture. Among all such graphs, the difference is maximum for a graph composed of three paths of almost equal lengths with a common end point.
This conjecture concerns the extremal relationship between average distance and proximity in connected graphs. The source notes that several related conjectures had been posed, one of which had already been solved, but gives no resolution for this claim.
Record
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.