ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree, and let DD be an orientation of TT. The Wiener index W(D)W(D) is the sum of the directed distances over all ordered pairs of vertices, where the distance is the length of a shortest directed path when one exists and is 00 otherwise.

Knor–Škrekovski–Tepeh conjecture. If DD maximises W(D)W(D) among all orientations of TT, then there exists a vertex vv in DD such that for every vertex uu there exists either a (u,v)(u,v)-path or a (v,u)(v,u)-path in DD.

The conjecture concerns the structure of orientations of trees with maximum Wiener index. The supplied text does not state whether it has been proved or disproved.

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.