The worst-case value conjecture for unweighted trees in Tron
Statement
Let an unweighted instance of \texttt{Tron} on a tree be an instance in which all vertex weights equal , where is the number of vertices. The unweighted-tree value conjecture. Any unweighted instance of \texttt{Tron} on a tree has value at most . The paper gives an unweighted tree with value , and establishes the corresponding bound for weighted trees, but determining the worst-case instance for unweighted trees remains open.
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.