Signed list-ranking of trees with many leaves
Statement
Let be a tree, let be its number of internal vertices, and let denote its signed list-ranking number. Signed tree list-ranking conjecture. For every positive integer , there is a positive integer such that, for every tree with internal vertices and at least leaves,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.