ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree. For a vertex ww and a neighbor xx of ww, let TxT^x denote the component containing xx after deleting ww, let μ(x)\mu(x) denote the number of isomorphism types among the branches rooted at xx, and let a(Tx)a(T^x) denote the number of distinguishing subsets of TxT^x. Characterization conjecture. The tree TT is 22-distinguishable if and only if, for any vertex ww and any neighbor xx of ww, μ(x)≤a(Tx)\mu(x)\leq a(T^x) if TxT^x is finite, and

μ(x)=2∣Tx∣\mu(x)=2^{|T^x|}

if TxT^x is infinite. This would characterize 2-distinguishable trees in terms of the number of branch types and distinguishing subsets of their rooted components, extending the preceding characterization of aa-maximum trees; the paper provides no resolution of the conjecture.

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.