ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Tn\mathcal{T}_{n} denote the class of trees on nn vertices, and let W[Tn]W[\mathcal{T}_{n}] be the set of their Wiener indices. Define Wint[Tn]W^{int}[\mathcal{T}_{n}] to be the largest interval of contiguous integers contained in W[Tn]W[\mathcal{T}_{n}]. Wiener inverse interval conjecture. The cardinality of Wint[Tn]W^{int}[\mathcal{T}_{n}] equals O(n3)O(n^{3}).

This conjecture concerns the length of the largest contiguous interval of Wiener-index values realized by trees with nn vertices. It is presented as one of the conjectures underlying the Wiener inverse interval problem for trees.

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.