Characterization of 2-distinguishable trees by branch orbit counts
Statement
Let be a tree. For a vertex and a neighbor of , let denote the component containing after deleting , let denote the number of isomorphism types among the branches rooted at , and let denote the number of distinguishing subsets of . Characterization conjecture. The tree is -distinguishable if and only if, for any vertex and any neighbor of , if is finite, and
if 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 -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.