ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let an unweighted instance of \texttt{Tron} on a tree be an instance in which all vertex weights equal 1/n1/n, where nn is the number of vertices. The unweighted-tree value conjecture. Any unweighted instance of \texttt{Tron} on a tree has value at most 1/101/10. The paper gives an unweighted tree with value 1/101/10, 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 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.