ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH) be a tree, and consider any path between leaf vertices. For a path of odd length 2n−12n-1, suppose that the numbers of subtrees rooted at the successive branches satisfy

C1H≥D1H≥C2H≥…≥CnH≥DnH.C^H_1 \geq D^H_1 \geq C^H_2 \geq \ldots \geq C^H_n \geq D^H_n.

For a path of even length 2n2n, suppose that

C1H≥D1H≥C2H≥…≥DnH≥Cn+1H.C^H_1 \geq D^H_1 \geq C^H_2 \geq \ldots \geq D^H_n \geq C^H_{n+1}.

Degree-ordering conjecture. The degrees along the odd-length path must satisfy

d(x1)≥d(y1)≥d(x2)≥…≥d(xn)≥d(yn),d(x_1) \geq d(y_1) \geq d(x_2) \geq \ldots \geq d(x_n) \geq d(y_n),

and those along the even-length path must satisfy

d(x1)≥d(y1)≥d(x2)≥…≥d(yn)≥d(xn+1).d(x_1) \geq d(y_1) \geq d(x_2) \geq \ldots \geq d(y_n) \geq d(x_{n+1}).

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 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.