The degree-ordering conjecture for subtree-maximizing trees
Statement
Let ) be a tree, and consider any path between leaf vertices. For a path of odd length , suppose that the numbers of subtrees rooted at the successive branches satisfy
For a path of even length , suppose that
Degree-ordering conjecture. The degrees along the odd-length path must satisfy
and those along the even-length path must satisfy
The claim asks whether the degree-switches used in the paper are unnecessary: the ordering obtained after the first two phases would already force the degree ordering targeted in Phase III. Its status is not resolved in the supplied source.
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.