ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph on n≥3n\geq 3 vertices. Let lˉ\bar{l} denote its average distance and let π\pi denote its proximity, the minimum average distance from a vertex to all other vertices.

Three-path conjecture. Among all such graphs, the difference lˉ−π\bar{l}-\pi 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.