ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT) be a tree of order n≥2n \geq 2. A subtree root is a zero of the subtree polynomial of TT. Define

Dn={z∈C ⁣: ∣z∣≤1+n−1n−1}.D_n=\left\{z\in\mathbb{C}\colon\ |z|\leq 1+\sqrt[n-1]{n-1}\right\}.

Disk conjecture. The subtree roots of TT lie in DnD_n.

This strengthens the proved bound for all trees by making the radius depend on the order nn; the authors verified the conjecture for all n≤18n\leq 18.

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.