ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a finite tree, and let crn⁡(T)\operatorname{crn}(T) denote its class reconstruction number. For the class of trees, write crn⁡(T)=max⁡T{crn⁡(T)}\operatorname{crn}(\mathcal{T})=\max_T\{\operatorname{crn}(T)\}, where T\mathcal{T} is the class of finite trees. Harary and Lauri's conjecture. The class reconstruction number of the class of trees is 2:

crn⁡(T)=2.\operatorname{crn}(\mathcal{T})=2.

Harary and Lauri had shown that the class reconstruction number is at most 3; the conjecture asserts that the upper bound can be improved to 2. The supplied text gives no evidence that this conjecture has been resolved.

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.