The Wiener inverse interval conjecture for trees
Statement
Let denote the class of trees on vertices, and let be the set of their Wiener indices. Define to be the largest interval of contiguous integers contained in . Wiener inverse interval conjecture. The cardinality of equals .
This conjecture concerns the length of the largest contiguous interval of Wiener-index values realized by trees with 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.