The disk conjecture for subtree roots of trees
Statement
Let ) be a tree of order . A subtree root is a zero of the subtree polynomial of . Define
Disk conjecture. The subtree roots of lie in .
This strengthens the proved bound for all trees by making the radius depend on the order ; the authors verified the conjecture for all .
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.