Path–star extremal conjecture for random tree search
Statement
Let be a tree on vertices. Write for the path and for the star on vertices, and let denote the first-player win probability when both players play uniformly at random. Path–star extremal conjecture. For every tree on vertices,
The paper computes the path probability as for and conjectures that stars and paths are the lower and upper extremes, respectively. The general inequality remains open in the supplied text.
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.