ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree, let pp be its number of internal vertices, and let ρℓ±(T)\rho^{\pm}_{\ell}(T) denote its signed list-ranking number. Signed tree list-ranking conjecture. For every positive integer pp, there is a positive integer qpq_p such that, for every tree TT with pp internal vertices and at least qpq_p leaves,

ρℓ±(T) equals the number of leaves of T.\rho^{\pm}_{\ell}(T)\text{ equals the number of leaves of }T.

The corresponding unsigned assertion is stated as the paper's third main theorem, while this signed analogue is suggested as a further strengthening. The source provides no resolution of the signed version.

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.